Pagini recente » Cod sursa (job #1808576) | Cod sursa (job #3137498) | Cod sursa (job #2679211) | Cod sursa (job #1477633) | Cod sursa (job #2640957)
#include <fstream>
#include <map>
using namespace std;
ifstream cin("loto.in");
ofstream cout("loto.out");
struct plm{
int v1,v2,v3;
};
map<int,plm> a;
int n,v[105],s;
int main()
{
cin>>n>>s;
for(int i=1;i<=n;i++){
cin>>v[i];
}
for(int i=1;i<=n;i++){
for(int j=i;j<=n;j++){
for(int k=j;k<=n;k++){
a.insert({v[i]+v[j]+v[k],{i,j,k}});
}
}
}
for(auto x:a){
auto y=a.find(s-x.first);
if(y!=a.end()){
cout<<v[x.second.v1]<<" "<<v[x.second.v2]<<" "<<v[x.second.v3]<<" "<<v[y->second.v1]<<" "<<v[y->second.v2]<<" "<<v[y->second.v3];
return 0;
}
}
cout<<-1;
return 0;
}