Pagini recente » Cod sursa (job #905478) | Borderou de evaluare (job #1282382) | Borderou de evaluare (job #1755306) | Borderou de evaluare (job #2071694) | Cod sursa (job #1688922)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("loto.in");
ofstream fout("loto.out");
int v[100],n,s;
int main(){
fin>>n>>s;
for(int i=1;i<=n;i++){fin>>v[i];}
sort(v+1,v+n+1);
if(v[n]*6<s){fout<<"-1";return 0;}
if(v[1]*6>s){fout<<"-1";return 0;}
int v1[1001],c=0;
for(int i=n;i>=1;i--){
while(s>v[i]){s-=v[i];v1[++c]=v[i];}
}
if(s<=v[1]&&s!=0){fout<<s;}
for(int i=c;i>=1;i--){fout<<v1[i]<<" ";}
return 0;
}