Pagini recente » Cod sursa (job #792951) | Cod sursa (job #1449307) | Cod sursa (job #1167437) | Cod sursa (job #9975) | Cod sursa (job #3246105)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("loto.in");
ofstream fout("loto.out");
struct Valori {
int a, b, c;
};
int n, s, i, j, k, a[102];
map<int, Valori> fr;
int main() {
cin >> n >> s;
for(i = 1; i <= n; i++) cin >> a[i];
for(i = 1; i <= n; i++) {
for(j = 1; j <= n; j++) {
for(k = 1; k <= n; k++) fr[a[i] + a[j] + a[k]] = {a[i], a[j], a[k]};
}
}
for(i = 1; i <= n; i++) {
for(j = 1; j <= n; j++) {
for(k = 1; k <= n; k++) {
int sum = a[i] + a[j] + a[k];
if(sum < s) {
auto it = fr.find(s - sum);
if(it != fr.end()) {
cout << a[i] << " " << a[j] << " " << a[k] << " ";
Valori v = it->second;
cout << v.a << " " << v.b << " " << v.c;
return 0;
}
}
}
}
}
cout << "-1";
return 0;
}