Pagini recente » Cod sursa (job #1976110) | Cod sursa (job #1621850) | Cod sursa (job #1632249) | Cod sursa (job #383718) | Cod sursa (job #2778224)
#include <bits/stdc++.h>
using namespace std;
int main() {
freopen ("loto.out","w",stdout);
freopen ("loto.in","r",stdin);
int n, s;
cin >> n >> s;
vector<int> a(n);
for(int i = 0; i < n; i++) cin >> a[i];
map<int, vector<int>> m;
for(int i = 0; i < n; i++) {
for(int j = 0; j < n; j++) {
for(int k = 0; k < n; k++) {
int sum = a[i] + a[j] + a[k];
vector<int> z = {a[i], a[j], a[k]};
m[sum] = z;
}
}
}
for(auto x : m) {
if(x.second.size() == 3) {
if(m[s - x.first].size() == 3) {
cout << x.second[0] << ' ' << x.second[1] << ' ' << x.second[2] << ' ';
cout << m[s - x.first][0] << ' ' << m[s - x.first][1] << ' ' << m[s - x.first][2];
return 0;
}
}
}
cout << -1;
}