Pagini recente » Cod sursa (job #209911) | Cod sursa (job #1683188) | Cod sursa (job #2738812) | Cod sursa (job #2643849) | Cod sursa (job #1772851)
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream in("date.in");
ofstream out("date.out");
int n,g,i,j,a[5001][3],ok=1,n1;
in>>n>>g;
for (i=1; i<=n; i++)
in>>a[i][1]>>a[i][2];
n1=n;
while (ok==1)
{
ok=0;
for (i=1; i<n1; i++)
if (a[i][2]<a[i+1][2])
{
swap(a[i][1],a[i+1][1]);
swap(a[i][2],a[i+1][2]);
ok=1;
}
else
if (a[i][2]==a[i+1][2] && a[i][1]>a[i+1][1])
swap(a[i][1],a[i+1][1]);
n1--;
}
for (i=1; i<=n; i++)
cout<<a[i][1]<<' '<<a[i][2]<<'\n';
n1=0;
j=0;
for (i=1; j<g; i++)
{
if (j+a[i][1]<=g)
{
n1+=a[i][2];
j+=a[i][1];
}
else
break;
}
out<<n1;
}