Pagini recente » Cod sursa (job #2488722) | Cod sursa (job #1230199) | Cod sursa (job #10410) | Cod sursa (job #2542820) | Cod sursa (job #2678959)
#include <bits/stdc++.h>
using namespace std;
ifstream fin (".in");
ofstream fout(".out");
int n, S, s, aux[150];
vector <int> v;
bool ok;
void rezolvare (int pos, int k) {
if (k == 6) {
if (s == S) {
for (int i = 1; i <= 6; ++i) {
fout << aux[i] << ' ';
}
ok = true;
}
return;
}
for (int i = pos; i >= 0; --i) {
s += v[i];
aux[++k] = v[i];
rezolvare(i, k);
if (ok)
return;
k --;
s -= v[i];
}
}
int main()
{
fin >> n >> S;
for (int i = 0; i < n; ++i) {
int x;
fin >> x;
v.push_back(x);
}
sort(v.begin(), v.end());
rezolvare(n - 1, 0);
if (!ok)
fout << -1;
return 0;
}