Pagini recente » Cod sursa (job #2056674) | Cod sursa (job #2685036) | Cod sursa (job #222247) | Cod sursa (job #2389148) | Cod sursa (job #1829924)
#include <fstream>
using namespace std;
ifstream fin("loto.in");
ofstream fout("loto.out");
int n, i, j, k, suma, v[102], nr, st, dr, mid;
char ok;
struct sum{
int s;
int a;
int b;
int c;
};
sum x[1000001];
void sortare(sum x[], int nr){
for(int i=1;i<nr;i++)
for(int j=i+1;j<=nr;j++)
if(x[i].a>x[j].a){
int aux=x[i].a;
x[i].a=x[j].a;
x[j].a=aux;
}
}
int main(){
fin>>n>>suma;
for(i=1;i<=n;i++)
fin>>v[i];
for(i=1;i<=n;i++)
for(j=i;j<=n;j++)
for(k=j;k<=n;k++){
x[++nr].s=v[i]+v[j]+v[k];
x[nr].a=v[i];
x[nr].b=v[j];
x[nr].c=v[k];
}
sortare(x, nr);
for(i=1;i<=nr;i++){
st=i;
dr=nr;
while(st<=dr){
mid=(st+dr)/2;
if(x[mid].s+x[i].s==suma){
fout<<x[mid].a<<" "<<x[mid].b<<" "<<x[mid].c<<" "<<x[i].a<<" "<<x[i].b<<" "<<x[i].c;
i=nr+1;
ok=1;
break;
}
else
if(x[mid].s+x[i].s<suma)
st=mid+1;
else
dr=mid-1;
}
}
if(ok==0)
fout<<"-1";
return 0;
}