Pagini recente » Cod sursa (job #1880501) | Cod sursa (job #2908833) | Cod sursa (job #2841935) | Cod sursa (job #1038506) | Cod sursa (job #3184746)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("loto.in");
ofstream fout("loto.out");
int v[105];
struct sume {
int a, b, c, s;
};
sume A[1000005];
bool cmp(sume a, sume b) {
return a.s < b.s;
}
int main()
{
int n, S;
fin>>n>>S;
for (int i=1;i<=n;i++) {
fin>>v[i];
}
int l=0;
for (int i=1;i<=n;i++) {
for (int j=i;j<=n;j++) {
for (int k=j;k<=n;k++) {
l++;
A[l].a=v[i];
A[l].b=v[j];
A[l].c=v[k];
A[l].s=v[i]+v[j]+v[k];
}
}
}
sort(A+1, A+l+1, cmp);
int j=l;
for (int i=1;i<=l;i++) {
while(A[i].s + A[j].s > S) {
j--;
}
if (j>=1 && A[i].s + A[j].s==S) {
fout<<A[i].a<<" "<<A[i].b<<" "<<A[i].c<<" "<<A[j].a<<" "<<A[j].b<<" "<<A[j].c<<" ";
return 0;
}
}
fout<<"-1";
return 0;
}