Pagini recente » Cod sursa (job #3345006) | Cod sursa (job #3343014) | Borderou de evaluare (job #2120864) | Borderou de evaluare (job #1026830) | Cod sursa (job #3358309)
#include <bits/stdc++.h>
using namespace std;
int v[105];
int main()
{
ifstream cin("loto.in");
ofstream cout("loto.out");
int n, s; cin >> n >> s;
for (int i = 1; i <= n; i ++)
{
cin >> v[i];
}
sort(v + 1, v + n + 1);
for (int sum = s / 2; sum >= v[n] + v[1] + v[2]; sum --)
{
int sum2 = s - sum;
vector<int> ans;
for (int i = 1; i <= n; i ++)
{
for (int j = 1; j <= n; j ++)
{
for (int k = 1; k <= n; k ++)
{
if (v[i] + v[j] + v[k] == sum)
{
ans.push_back(v[i]);
ans.push_back(v[j]);
ans.push_back(v[k]);
i = j = k = n + 1;
}
}
}
}
for (int i = 1; i <= n; i ++)
{
for (int j = 1; j <= n; j ++)
{
for (int k = 1; k <= n; k ++)
{
if (v[i] + v[j] + v[k] == sum2)
{
ans.push_back(v[i]);
ans.push_back(v[j]);
ans.push_back(v[k]);
i = j = k = n + 1;
}
}
}
}
if (ans.size() == 6)
{
sort(ans.begin(), ans.end());
for (auto i : ans)
{
cout << i << ' ';
}
return 0;
}
}
cout << -1;
}