Pagini recente » Cod sursa (job #1732830) | Cod sursa (job #1133809) | Istoria paginii monthly-2014/runda-1/solutii | Cod sursa (job #104531) | Cod sursa (job #1451340)
// Created by PhantomCracker. Copyright(c) PhantomCracker
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("loto.in");
ofstream g("loto.out");
int n;
long suma;
int numere[10000];
int numere_suma[10000];
int suma_noua;
int k, stop;
void sortare()
{
for(int i=1; i<=n; i++)
for(int j=i; j<n; j++)
if(numere[i] > numere[j])
{
int aux = numere[i];
numere[i] = numere[j];
numere[j] = aux;
}
}
int selectare_numere()
{
int ok=1;
int suma_noua = 0;
k=1;
for(int i=1; i<=6/n; i++)
{
for(int j=1; j<=n; j++)
{
if(suma_noua>=suma)
break;
numere_suma[k] = numere[j];
suma_noua = suma_noua + numere[j];
k++;
stop++;
}
if(suma_noua<suma || suma_noua>suma)
ok = -1;
}
cout<<endl;
return ok;
}
int main()
{
f>>n>>suma;
for(int i=1; i<=n; i++)
f>>numere[i];
sortare();
if(selectare_numere()==1)
for(k=1; k<=stop; k++)
g<<numere_suma[k]<<" ";
else g<<selectare_numere();
cout<<endl;
return 0;
}
//