Pagini recente » Cod sursa (job #2918521) | Cod sursa (job #1391218) | Cod sursa (job #2652199) | Cod sursa (job #606337) | Cod sursa (job #2119290)
#include <fstream>
using namespace std;
ifstream in("ghiozdan.in");
ofstream out("ghiozdan.out");
void sortareVector(int x, int a[20000])
{
short k, j, i;
do
{
k = 0;
for(i = 1; i < x; i++)
if(a[i] < a[i+1])
{
j = a[i];
a[i] = a[i+1];
a[i+1] = j;
k = 1;
}
}
while(k != 0);
}
int main()
{
int n, g, gmax = 0, nmin = 0, m[20000], i, q, p = 1;
in >> n >> g;
q = n;
for(i = 1; i <= n; i++)
in >> m[i];
sortareVector(n, m);
for(i = 1; i <= q && p == 1; i++)
{
if(m[i] <= g)
{
g = g - m[i];
n--;
gmax = gmax + m[i];
nmin++;
}
if(n == 0 || g == 0)
p = 0;
}
out << gmax << " " << nmin;
return 0;
}