Pagini recente » Cod sursa (job #3176065) | Cod sursa (job #570807) | Cod sursa (job #1011735) | Cod sursa (job #2765419) | Cod sursa (job #2300365)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("loto.in");
ofstream fout("loto.out");
int n,S;
int a[105];
struct El
{
int x,y,z;
};
map<int,El>M;
set<int>s;
set<int>::iterator it;
int main()
{
fin>>n>>S;
for(int i=1;i<=n;i++)
fin>>a[i];
int v,ok;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
for(int k=1;k<=n;k++)
{
v=a[i]+a[j]+a[k];
M[v]={a[i],a[j],a[k]};
s.insert(v);
}
ok=0;
for(auto i:s)
{
it=s.find(S-i);
if(it!=s.end())
{
fout<<M[i].x<<" "<<M[i].y<<" "<<M[i].z<<" "<<M[S-i].x<<" "<<M[S-i].y<<" "<<M[S-i].z<<"\n";
ok=1;
break;
}
}
if(!ok)fout<<"-1\n";
fin.close();
fout.close();
return 0;
}