Pagini recente » Cod sursa (job #240264) | Cod sursa (job #380754) | Cod sursa (job #496975) | Cod sursa (job #1442123) | Cod sursa (job #2159324)
#include <iostream>
#include <fstream>
#include <iomanip>
using namespace std;
void afisare(int v[],int n)
{
int i;
for(i=1;i<=n;i++)
cout << v[i] << " " ;
cout << endl;
}
int main()
{
int n,g,greu[2][5010];
int i,j;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
fin >> n >> g;
for(i=1;i<=n;i++)
fin >> greu[0][i] >> greu[1][i];
int x,y,maxim[10010]={0};
for(i=1;i<=n;i++)
{
x=greu[0][i];
y=greu[1][i];
for(j=g;j>=x;j--)
{
if(maxim[j-x]+y>maxim[j])
maxim[j]=maxim[j-x]+y;
}
}
fout << maxim[g];
fin.close();
fout.close();
return 0;
}