Pagini recente » Cod sursa (job #2207433) | Cod sursa (job #350659) | Cod sursa (job #2724248) | Cod sursa (job #1005828) | Cod sursa (job #2847215)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f ("rucsac.in");
ofstream g ("rucsac.out");
int N,Gmax,G[5001],P[5001],d[10001];
int main() {
f>>N>>Gmax;
for(int i=1;i<=N;i++)
f>>G[i]>>P[i];
int sol=0;
d[0]=0;
for(int i=1;i<=N;i++)
{
for(int j=Gmax-G[i];j>=0;j--)
if(d[j+G[i]]<d[j]+P[i])
{
d[j+G[i]]=d[j]+P[i];
sol=max(sol,d[j+G[i]]);
}
}
g<<sol;
return 0;
}