Cod sursa(job #1370732)
Utilizator | Data | 3 martie 2015 16:43:42 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <iostream>
#include <fstream>
#include <cstdio>
using namespace std;
ofstream g("rucsac.out");
int gr,n,a[100001],i,w,p,j,maxim;
int main()
{
freopen("rucsac.in","r",stdin);
scanf("%d%d",&n,&gr);
for(i=1;i<=n;i++)
{
scanf("%d%d",&w,&p);
for(j=gr-w;j>=0;j--)
{
if(a[j+w]<=a[j]+p)
{
a[j+w]=a[j]+p;
}
}
}
for(i=1;i<=gr;i++)
{
if(a[i]>maxim) maxim=a[i];
}
g<<maxim;
return 0;
}