Cod sursa(job #1267726)
| Utilizator | Data | 20 noiembrie 2014 10:22:42 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int n,g,i,j,v[1001],Max,w,p;
int main()
{
fin>>n>>g;
for(i=0;i<=n;i++)
{
v[i]=-1;
}
for(i=1;i<=n;i++)
{
fin>>w>>p;
for(j=n-w;j>=1;j--)
{
if(v[j]==-1||v[j]<p)
if(v[j]==-1)
v[j]=p;
else
v[j]+=p;
}
}
for(i=1;i<=n;i++)
if(v[i]>Max)
Max=v[i];
fout<<Max;
return 0;
}
