Cod sursa(job #1095052)
Utilizator | Data | 30 ianuarie 2014 12:02:18 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
using namespace std;
ifstream in("rucsac.in");
ofstream out("rucsac.out");
int mx,a[10001],i,j,gr,pr,g,n;
int main()
{
in>>n>>g;
for(i=1;i<=g;i++)
a[i]=-1;
for(i=1;i<=n;i++){
in>>gr>>pr;
for(j=g-gr;j>=0;j--)
if(a[j]>=0&&a[j]+pr>a[j+gr])
a[j+gr]=a[j]+pr;}
for(i=1;i<=g;i++)
if(a[i]>mx)
mx=a[i];
out<<mx;
return 0;
}