Pagini recente » Cod sursa (job #33453) | Cod sursa (job #1871682) | Cod sursa (job #1318789) | Cod sursa (job #1638777) | Cod sursa (job #2623005)
#include<bits/stdc++.h>
#include<fstream>
#include<iostream>
#include <queue>
using namespace std;
ifstream f("loto.in");
ofstream f1("loto.out");
int main(){
int n,s;
f>>n>>s;
int v[n];
vector <int> folosite;
for (int i=0;i<n;i++)
f>>v[i];
sort(v,v+n);
int suma=0;
int i=n-1;
while (suma<s && i!=-1){
if (s-suma<v[i]){
i--;
}
else{
suma+=v[i];
folosite.push_back(v[i]);
}
}
cout<<suma;
if (suma!=s){
f1<<-1;
}
else{
for (int j=0;j<folosite.size();j++){
f1<<folosite[j]<<" ";
cout<<folosite[j]<<" ";
}
}
}