Cod sursa(job #1448029)
| Utilizator | Data | 5 iunie 2015 23:15:35 | |
|---|---|---|---|
| Problema | Economie | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.53 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("economie.in");
ofstream fout("economie.out");
int n,a[50005],v[50005],t;
bool viz[50005];
int main()
{
int i,j;
fin>>n;
viz[0] = true;
for(i=1;i<=n;i++) fin>>v[i];
sort(v+1,v+n+1);
for(i=1;i<=n;i++)
if(!viz[i])
{
a[++t] = v[i];
for(j=0;j<=50000-v[i];j++)
if(viz[j]==true) viz[v[i]+j] = true;
}
for(i=1;i<=t;i++) fout<<a[i]<<" ";
fout.close();
return 0;
}
