Cod sursa(job #1023531)
| Utilizator | Data | 7 noiembrie 2013 10:02:11 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.71 kb |
#include <fstream>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
#define inf 2000000000
int x,y,n,gr,w,p,v[10001],j,i;
int main()
{
int max=-1;
f>>n>>gr;
for(i=1;i<=gr;i++)
v[i]=inf;
for(i=1;i<=n;i++){
f>>w>>p;
for(j=gr-w;j>=0;j--)
if(v[j]!=inf)
{
if(v[j+w]==inf)
v[j+w]=v[j]+p;
else
if(v[j+w]<v[j]+p)
v[j+w]=v[j]+p;
}
}
for(i=gr;i>=1;i--)
if(v[i]!=inf && v[i]>max){
max=v[i];
}
g<<max;
return 0;
}
