Pagini recente » Cod sursa (job #2551982) | Cod sursa (job #818192) | Cod sursa (job #271795) | Cod sursa (job #2602205) | Cod sursa (job #2987222)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("economie.in");
ofstream fout("economie.out");
int n,v[1005],maxim,nr,posibil[1005];
vector <int> res;
int main()
{
fin>>n;
for(int i=1;i<=n;i++){
fin>>v[i];
if(v[i]>maxim)maxim=v[i];
}
sort(v+1,v+n+1);
posibil[0]=1;
bool ok=true;
for(int i=1;i<=n;i++){
for(int j=0;j<=maxim;j++)
{
if(posibil[j]){
posibil[j+v[i]]=1;
}
}
res.push_back(v[i]);
for(int i=1;i<=maxim;i++)
if(posibil[i]==0)ok=false;
if(ok==true)
i=maxim;
}
fout<<res.size()<<endl;
for(auto el:res)
fout<<el<<endl;
return 0;
}