Pagini recente » Cod sursa (job #1362060) | Cod sursa (job #293082) | Cod sursa (job #2701363) | Cod sursa (job #1634106) | Cod sursa (job #2778578)
#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 = i; j < n; j++) {
for(int k = j; k < n; k++) {
int sum = a[i] + a[j] + a[k];
vector<int> z = {a[i], a[j], a[k]};
m[sum] = z;
if(m[s - sum].size() == 3) {
cout << a[i] << ' ' << a[j] << ' ' << a[k] << ' ';
cout << m[s - sum][0] << ' ' << m[s - sum][1] << ' ' << m[s - sum][2] << '\n';
return 0;
}
}
}
}
cout << -1;
}