Cod sursa(job #1465269)
Utilizator | Constantin-Buliga Stefan fanache99 | Data | 26 iulie 2015 21:18:52 |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include<cstdio>
using namespace std;
int dp[20010];
int main (){
freopen("rucsac.in","r",stdin);
freopen("rucsac.out","w",stdout);
int n,gmax,i,g,p,maxim=-1,j;
scanf("%d%d",&n,&gmax);
for(i=1;i<=n;i++){
scanf("%d%d",&g,&p);
for(j=gmax;j>=0;j--)
if(dp[j]>0||j==0)
if(dp[j]+p>dp[j+g])
dp[j+g]=dp[j]+p;
}
for(i=1;i<=gmax;i++)
if(dp[i]>maxim)
maxim=dp[i];
printf("%d",maxim);
return 0;
}