Pagini recente » Cod sursa (job #771208) | Cod sursa (job #2877162) | Cod sursa (job #3347235) | Cod sursa (job #3351882) | Cod sursa (job #3314094)
#include<fstream>
#include<algorithm>
#include<queue>
#include<iomanip>
#include<map>
#include<stack>
#include<cmath>
#include<cstring>
using namespace std;
//#define int long long
ifstream cin("loto.in");
ofstream cout("loto.out");
struct triplet
{
int a, b, c;
};
unordered_map<int, triplet>mp;
int v[1001];
int main(){
int n, s;
cin>>n>>s;
for(int i=1;i<=n;i++)
{
cin>>v[i];
}
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
for(int k=1;k<=n;k++)
{
mp[v[i]+v[j]+v[k]]={v[i], v[j], v[k]};
}
}
}
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
for(int k=1;k<=n;k++)
{
int r=s-v[i]-v[j]-v[k];
if(mp.count(r))
{
cout<<v[i]<<" "<<v[j]<<" "<<v[k]<<" "<<mp[r].a<<" "<<mp[r].b<<" "<<mp[r].c;
return 0;
}
}
}
}
cout<<-1;
return 0;
}