Pagini recente » Cod sursa (job #2597997) | Cod sursa (job #2598032) | Cod sursa (job #3041485) | Cod sursa (job #3041487) | Cod sursa (job #3259098)
#include <fstream>
#include <bitset>
#include <vector>
#include <algorithm>
using namespace std;
ifstream cin("economie.in");
ofstream cout("economie.out");
vector<int>elemselectate;
short v[1001],n;
bitset<100001>frecv;
int main()
{
cin>>n;
for(int i=1;i<=n;i++)
cin>>v[i];
sort(v+1,v+n+1);
frecv[0]=1;
for(int i=1;i<=n;i++)
{
if(!frecv[v[i]])
{
for(int j=v[i];j<=v[n];j++)
{
frecv[j] = max(frecv[j],frecv[j-v[i]]);
}
elemselectate.push_back(v[i]);
}
}
cout<<elemselectate.size()<<'\n';
for(int i=0;i<elemselectate.size();i++)
cout<<elemselectate[i]<<'\n';
return 0;
}