Pagini recente » Cod sursa (job #3335856) | Cod sursa (job #3343618) | Cod sursa (job #3327667) | Cod sursa (job #3318311) | Cod sursa (job #3356247)
// Source: https://usaco.guide/general/io
#include <bits/stdc++.h>
using namespace std;
int n,s,v[105],sum;
map<int,tuple<int,int,int>>mp;
vector<int> sol;
int main() {
ifstream cin("loto.in");
ofstream cout("loto.out");
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++)
{
sum=0;
sum+=v[i]+v[j]+v[k];
mp[sum]={v[i],v[j],v[k]};
}
for(auto I:mp)
{
int val=I.first;
if(mp.count(s-val))
{
sol.push_back(get<0>(I.second));
sol.push_back(get<1>(I.second));
sol.push_back(get<2>(I.second));
sol.push_back(get<0>(mp[s-val]));
sol.push_back(get<1>(mp[s-val]));
sol.push_back(get<2>(mp[s-val]));
break;
}
}
if(!sol.empty())
{
sort(sol.begin(),sol.end());
for(auto I:sol)
cout<<I<<' ';
}
else cout<<-1;
}