Pagini recente » Cod sursa (job #1640298) | Cod sursa (job #1401549) | Cod sursa (job #2609997) | Cod sursa (job #1259675) | Cod sursa (job #2456429)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream in("loto.in");
ofstream out("loto.out");
struct four {
long long int val1, val2, val3, sum;
};
four a[1030302];
long long int n, s, v[101], contor = 0;
bool comp(four x, four y) {
return x.sum < y.sum;
}
int main() {
ios_base::sync_with_stdio(false);
in.tie(NULL), out.tie(NULL);
in >> n >> s;
for (int i = 0; i < n; i++)in >> v[i];
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
for (int k = 0; k < n; k++) {
a[contor].val1 = v[i];
a[contor].val2 = v[j];
a[contor].val3 = v[k];
a[contor].sum = v[i] + v[j] + v[k];
contor++;
}
}
}
sort(a, a + contor, comp);
long long int left = 0, right = contor - 1, ok = 0;
while (left < right) {
if (a[left].sum + a[right].sum == s) {
out << a[left].val1 << " " << a[left].val2 << " " << a[left].val3 << " " << a[right].val1 << " " << a[right].val2 << " " << a[right].val3;
ok = 1;
break;
}
if (a[left].sum + a[right].sum < s)left++;
else right++;
}
if (ok == 0)out << -1;
}