Pagini recente » Cod sursa (job #198901) | Cod sursa (job #2329308) | Cod sursa (job #3184273) | Cod sursa (job #1190500) | Cod sursa (job #2975586)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("loto.in");
ofstream fout("loto.out");
int n, s, v[1001], nr;
struct elem
{
int x;
int y;
int z;
int sum;
}a[1000001];
int cmp(elem a, elem b)
{
return a.sum<b.sum;
};
int main()
{
fin>>n>>s;
for(int i=1; i<=n; i++)
{
fin>>v[i];
}
for(int i=1; i<=n; i++)
{
for(int j=i; j<=n; j++)
{
for(int k=j; k<=n; k++)
{
a[++nr]={v[i], v[j], v[k], v[i]+v[j]+v[k]};
}
}
}
sort(a+1, a+nr+1, cmp);
for(int i=1; i<=nr; i++)
{
int st=1;
int dr=nr;
int suma=s-a[i].sum;
while(st<=dr)
{
int mid=(st+dr)/2;
if(a[mid].sum==suma)
{
fout<<a[i].x<<" "<<a[i].y<<" "<<a[i].z<<" "<<a[mid].x<<" "<<a[mid].y<<" "<<a[mid].z;
return 0;
}
if(a[mid].sum>suma)
{
dr=mid-1;
}
if(a[mid].sum<suma)
{
st=mid+1;
}
}
}
fout<<"-1";
return 0;
}