Pagini recente » Cod sursa (job #2183798) | Cod sursa (job #1977858) | Cod sursa (job #2627066) | Cod sursa (job #2241639) | Cod sursa (job #2202227)
#include <bits/stdc++.h>
using namespace std;
int G[75000],N[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--){
if(G[j-V[i]]+V[i]>G[j]|| G[j-V[i]]+V[i]==G[j] && N[j-V[i]]+1<N[j]){
G[j]=G[j-V[i]]+V[i];
N[j]=N[j-V[i]]+1;
}
}
}
fout<<G[g]<<' '<<N[g];
return 0;
}