Pagini recente » Cod sursa (job #2814522) | Cod sursa (job #1959288) | Cod sursa (job #2708306) | Cod sursa (job #2976848) | Cod sursa (job #2948216)
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("loto.in");
ofstream fout("loto.out");
struct ceva
{
int s,a,b,c;
}v[100*100*100+10];
int x[110],lg,n,i,j,k,poz,sum,s,st,dr,mij;
bool cmp(ceva a,ceva b)
{
return a.s <b.s;
}
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[++lg].s=x[i]+x[j]+x[k];
v[lg].a=x[i];
v[lg].b=x[j];
v[lg].c=x[k];
}
sort(v+1,v+lg+1,cmp);
for(i=1;i<=lg;i++)
{
if(v[i].s>=s)
break;
sum=s-v[i].s;
st=1;
dr=lg;
poz=-1;
while(st<=dr)
{
mij=(st+dr)/2;
if(v[mij].s==sum)
{
poz=mij;
break;
}
if(v[mij].s>sum)
dr=mij-1;
else st=mij+1;
}
if(poz!=-1)
{
fout<<v[i].a<<" "<<v[i].b<<" "<<v[i].c<<" "<<v[poz].a<<" "<<v[poz].b<<" "<<v[poz].c;
return 0;
}
}
fout<<-1;
return 0;
}