Pagini recente » Cod sursa (job #3251717) | Cod sursa (job #1864844) | Cod sursa (job #1965185) | Cod sursa (job #223642) | Cod sursa (job #59420)
Cod sursa(job #59420)
#include<fstream.h>
long int a[999],aux,n,s,i,j,cont,boo,x[999];
int main ()
{
ifstream fin("loto.in");
ofstream fout("loto.out");
fin>>n>>s;
for ( i=1 ; i<=n ; i++ )
fin>>x[i];
do {
boo=0;
for ( i=1 ; i<n; i++ )
if(x[i]<x[i+1]) { aux=x[i];
x[i]=x[i+1];
x[i+1]=aux;
boo=1;
}
} while(boo);
i=1; cont=0;
while(cont<=s&&i<=n&&j<6)
{ if(cont+x[i]<=s) { cont+=x[i]; a[++j]=x[i]; }
else i++;
}
do {
boo=0;
for ( i=1 ; i<j; i++ )
if(a[i]>a[i+1]) { aux=a[i];
a[i]=a[i+1];
a[i+1]=aux;
boo=1;
}
} while(boo);
if(cont==s) for ( i=1; i<=j; i++ ) fout<<a[j]<<" ";
else fout<<"-1";
fin.close();
fout.close();
return 0;
}