Pagini recente » Cod sursa (job #1713307) | Cod sursa (job #1075598) | Cod sursa (job #2065316) | Cod sursa (job #210443) | Cod sursa (job #2970629)
#include<fstream>
using namespace std;
ifstream in("rucsac.in");
ofstream out("rucsac.out");
const int N=5e3;
const int G=1e4;
int prf[G+1];
struct ob
{
int g;
int p;
}v[N+1];
int main()
{
int n, G, maxi=-1;
in >> n >> G;
for(int i=0; i<n; i++)
{
in >> v[i].g >> v[i].p;
}
for(int i=0; i<G; i++)
prf[i]=-1;
prf[0]=0;
for(int i=0; i<n; i++)
{
for(int j=G-v[i].g; j>=0; j--)
{
if(prf[j]!=-1 && prf[j]+v[i].p > prf[j+v[i].g])
{
prf[j+v[i].g]=prf[j] + v[i].p;
}
}
}
for(int i=1; i<=G; i++)
if(prf[i]>maxi)maxi=prf[i];
out << maxi;
return 0;
}