Pagini recente » Cod sursa (job #229371) | Cod sursa (job #2523365) | Cod sursa (job #1090507) | Cod sursa (job #2635915) | Cod sursa (job #3239298)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("loto.in");
ofstream fout("loto.out");
int sol[7],s,n,i,j,v[101],aux;
int main()
{
fin>>n>>s;
aux = s;
for(i=0;i<n;i++)
fin>>v[i];
sort(v,v+n);
j=n-1;
for(i=6;i>0;i--){
while(s-v[j] < (i-1)*v[0] && j >= 0)
j--;
if(j<0){
fout<<-1;
return 0;
}
sol[i] = v[j];
s -= v[j];
}
s=0;
for(i=1;i<=6;i++)
s+=sol[i];
if(s != aux){
fout<<-1;
return 0;
}
for(i=1;i<=6;i++)
fout<<sol[i]<<' ';
return 0;
}