Pagini recente » Cod sursa (job #2772212) | Cod sursa (job #980735) | Cod sursa (job #1024816) | Cod sursa (job #3285200) | Cod sursa (job #3248086)
#include <fstream>
#include <vector>
using namespace std;
ifstream cin("rucsac.in");
ofstream cout("rucsac.out");
struct ob
{
int w, p;
};
int n, G, ans;
vector <int> dp;
vector <ob> v;
int main()
{
cin >> n >> G;
dp.resize(G+1);
v.resize(n+1);
for(int i=1; i<=n; i++)
cin >> v[i].w >> v[i].p;
for(int i=1; i<=n; i++)
for(int j=G - v[i].w; j>=0; j--)
if(dp[j + v[i].w] < dp[j] + v[i].p)
dp[j + v[i].w] = dp[j] + v[i].p;
for(int i=1; i<=G; i++)
ans = max(ans, dp[i]);
cout << ans;
return 0;
}