Pagini recente » Cod sursa (job #1577422) | Cod sursa (job #2682323) | Cod sursa (job #2409010) | Cod sursa (job #2121295) | Cod sursa (job #2185179)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ghiozdan.in");
ofstream fout("ghiozdan.out");
int g[20003],i,n,G,r,rs,c[20003];
bool k;
int main(){
fin>>n>>r;
for (i=1;i<=n;i++)
fin>>g[i];
k=false;
while (!k){
k=true;
for (i=1;i<=n-1;i++)
if (g[i]>g[i+1]) {
rs=g[i];
g[i]=g[i+1];
g[i+1]=rs;
k=false;
}
}
G=0;
i=1;
while (G+g[i]<=r) {
G=G+g[i];
c[i]=g[i];
i++;
}
fout<<G<<'\n';
fout<<i-1<<'\n';
for (i=1;i<=n;i++)
if (c[i!=0]) fout<<c[i]<<'\n';
return 0;
fin.close();
fout.close();
}