Pagini recente » Cod sursa (job #2583977) | Cod sursa (job #1767587) | Cod sursa (job #1305951) | Cod sursa (job #1818139) | Cod sursa (job #3214927)
#include <bits/stdc++.h>
#pragma optimize GCC ("Ofast")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
///#include <tryhardmode>
///#include <GODMODE::ON>
using namespace std;
#define int long long
#define cin fin
#define cout fout
ifstream fin ("rucsac.in");
ofstream fout ("rucsac.out");
const int INF=-2e9;
const int NMAX=5e3+5;
const int GMAX=1e4+5;
int dp[GMAX];
struct elem{
int g;
int val;
}v[NMAX];
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n,m,i,j,greu,best=0;
cin>>n>>greu;
for(i=1;i<=greu;i++)
dp[i]=INF;
dp[0]=0;
for(i=1;i<=n;i++)
cin>>v[i].g>>v[i].val;
for(i=1;i<=n;i++)
{
for(j=greu;j>=0;j--)
{
if(j+v[i].g>greu || dp[j]==INF)
continue;
else
{
if(dp[j+v[i].g]<dp[j]+v[i].val)
{
dp[j+v[i].g]=dp[j]+v[i].val;
best=max(best,dp[j+v[i].g]);
}
}
}
}
cout<<best;
return 0;
}