Pagini recente » Cod sursa (job #661498) | Cod sursa (job #1436071) | Rating Mihai Iulian (Mihai28276_) | Cod sursa (job #405146) | Cod sursa (job #2648142)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("loto.in");
ofstream fout("loto.out");
struct ceva
{
int a,b,c;
int s;
}v[1000010];
int cmp(ceva a,ceva b)
{
return a.s <b.s;
}
int n,i,j,mij,st,dr,cnt,k,s,x[110];
int main()
{
fin>>n>>s;
for(i=1;i<=n;i++)
fin>>x[i];
for(i=1;i<=n;i++)
for(j=i;j<=n;j++)
for(k=j;k<=n;k++)
{
v[++cnt].s=x[i]+x[j]+x[k];
v[cnt].a=x[i];
v[cnt].b=x[j];
v[cnt].c=x[k];
}
sort(v+1,v+cnt+1,cmp);
for(i=1;i<=cnt;i++)
{
st=1;
dr=cnt;
while(st<=dr)
{
mij=(st+dr)/2;
if(v[i].s+v[mij].s==s)
{
fout<<v[i].a<<" "<<v[i].b<<" "<<v[i].c<<" "<<v[mij].a<<" "<<v[mij].b<<" "<<v[mij].c<<'\n';
return 0;
}
if(v[i].s+v[mij].s>s)
dr=mij-1;
else st=mij+1;
}
}
fout<<-1;
return 0;
}