Pagini recente » Cod sursa (job #832175) | Cod sursa (job #806002) | Cod sursa (job #2771504) | Cod sursa (job #2549888) | Cod sursa (job #1074893)
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fi("loto.in");
ofstream fo("loto.out");
struct valori {
int a,b,c,suma;};
int v[100],s,x,y,nr;
short n;
valori w[1000002];
int comparare(const valori &x,const valori &y)
{
return(x.suma < y.suma);
}
int main()
{
fi>>n>>s;
for (int i=1;i<=n;i++) {
fi>>v[i];
if (v[i]*6==s)
x=v[i];
if (v[i]>y)
y=v[i];
}
if (x!=0)
for (int i=1;i<=6;i++)
fo<<x<<' ';
else
if (y*6<s)
fo<<'-1';
else {
for (int i=1;i<=n;i++)
for (int j=i;j<=n;j++)
for (int k=j;k<=n;k++) {
nr++;
w[nr].a=v[i];
w[nr].b=v[j];
w[nr].c=v[k];
w[nr].suma=v[i]+v[j]+v[k];
}
sort(w+1,w+nr+1,comparare);
for (int i=1;i<=nr;i++)
for (int j=i;j<=nr;j++)
if (w[i].suma+w[j].suma==s) {
x=i;
y=j;
break;
}
}
fo<<w[x].a<<' '<<w[x].b<<' '<<w[x].c<<' '<<w[y].a<<' '<<w[y].b<<' '<<w[y].c;
return 0;
}