Pagini recente » Cod sursa (job #2960780) | Cod sursa (job #3147428) | Cod sursa (job #503131) | Cod sursa (job #2456868) | Cod sursa (job #1183255)
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
int n,s,v[101],x[6],i,cat,j,aux;
ifstream f;
ofstream g;
f.open("loto.in");
g.open("loto.out");
f >> n >> s;
for ( i = 0 ; i < n ; i++ )
f >> v[i];
for ( i = 0 ; i < n - 1 ; i++ )
for ( j = i + 1 ; j < n ; j++ )
if ( v[i] > v[j] )
{
aux = v[i];
v[i] = v[j];
v[j] = aux;
}
for ( i = 6 ; i >= 1 ; i-- )
{
cat = s / i;
for ( j = 0 ; j < n ; j++ )
if ( v[j] > cat )
break;
j--;
x[6 - i] = v[j];
s -= v[j];
}
for ( i = 0 ; i < 6 ; i++ )
for ( j = i + 1 ; j < 6 ; j++ )
if ( x[i] > x[j] )
{
aux = x[i];
x[i] = x[j];
x[j] = aux;
}
for ( i = 0 ; i < 6 ; i++ )
g << x[i] << " ";
return 0;
}