Pagini recente » Cod sursa (job #63416) | Cod sursa (job #2245545) | Cod sursa (job #2377803) | Cod sursa (job #2604939) | Cod sursa (job #2974793)
#include <bits/stdc++.h>
#define tii tuple<int, int, int>
#define MAX 102
using namespace std;
int n,s,v[MAX];
unordered_map<int, tii> mp;
vector<tii> sume;
ifstream fin("loto.in");
ofstream fout("loto.out");
int main()
{
fin >> n >> s;
for(int i = 1; i <= n; i++){
fin >> v[i];
}
for(int i = 1; i <= n; i++){
for(int j = i; j <= n; j++){
for(int k = j; k <= n; k++){
sume.push_back({v[i], v[j], v[k]});
mp[v[i]+v[j]+v[k]] = {v[i], v[j], v[k]};
}
}
}
for(auto [x, y, z]: sume){
int rest = s-x-y-z;
if(mp.count(rest)){
auto [i, j, k] = mp[rest];
fout << x << " " << y << " " << z << " " << i << " " << j << " " << k;
exit(0);
}
}
fout << "-1";
return 0;
}