Pagini recente » Cod sursa (job #1202592) | Cod sursa (job #1878946) | Cod sursa (job #835289) | Cod sursa (job #2549693) | Cod sursa (job #3186479)
#include <bits/stdc++.h>
using namespace std;
struct nr_suma {
long long a, b, c, s;
};
#define MAXN 100
#define NMAX 1000000
nr_suma A[NMAX];
bool cmp( nr_suma x, nr_suma y ){
return x.s < y.s;
}
int v[MAXN];
int main(){
ifstream cin( "loto.in" );
ofstream cout( "loto.out" );
int n, i, j, k, l;
long long s;
cin >> n >> s;
for( i = 0; i < n; i++ )
cin >> v[i];
l = 0;
for( i = 0; i < n; i++ )
for( j = i; j < n; j++ )
for( k = j; k < n; k++ ){
A[l].a = v[i];
A[l].b = v[j];
A[l].c = v[k];
A[l].s = v[i] + v[j] + v[k];
l++;
}
sort( A, A + l, cmp );
j = l - 1;
for( i = 0; i < l; i++ ){
while( j >= 0 && A[i].s + A[j].s > s )
j--;
if( j >= 0 && A[i].s + A[j].s == s ){
cout << A[i].a << " " << A[i].b << " " << A[i].c << " " <<
A[j].a << " " << A[j].b << " " << A[j].c;
return 0;
}
}
cout << -1;
return 0;
}