Pagini recente » Cod sursa (job #1121038) | Cod sursa (job #2334096) | Cod sursa (job #1723713) | Cod sursa (job #2315847) | Cod sursa (job #2204461)
#include <bits/stdc++.h>
using namespace std;
int G[75000],N[75000];//,G2[75000],N2[75000];
short V[20000];
int main(){
int n,g;
ifstream fin("ghiozdan.in");
ofstream fout("ghiozdan.out");
fin>>n>>g;
for (int i=0;i<n;i++) fin>>V[i];
for (int i=0;i<n;i++){
for (int j=g;j>=V[i];j--){
int p = j-V[i];
if(G[p]>G[j] || (G[p]+V[i]==G[j] && N[p]+1<N[j])){
G[j]=G[p]+V[i];
N[j]=N[p]+1;
}
}
//for(int j=1;j<=g;j++)
// cout<<G[j]<<' ';
//cout<<'\n';
}
fout<<G[g]<<' '<<N[g]<<'\n';
return 0;
}