Pagini recente » Cod sursa (job #1628775) | Cod sursa (job #1421854) | Cod sursa (job #2436691) | Cod sursa (job #2493812) | Cod sursa (job #3261942)
#include <fstream>
#include <iostream>
#include <algorithm>
#include <vector>
#include <cstring>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int dp[10001];
struct obj{int gr,pf;}o[5001];
int main()
{
int N,G;
fin>>N>>G;
for(int i=1;i<=N;i++)
fin>>o[i].gr>>o[i].pf;
for(int i=1;i<=N;i++)
{
for(int j=G;j>=1;j--)
{
int g_cr=o[i].gr;
int p_cr=o[i].pf;
if(j>=g_cr)
dp[j]=max(dp[j-g_cr]+p_cr,dp[j]);
}
}
fout<<dp[G];
return 0;
}