Cod sursa(job #936741)
Utilizator | Data | 8 aprilie 2013 16:20:07 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include<fstream>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int i,j,v[200000],w,n,p,G,maxi;
int main()
{
f>>n>>G;
v[0]=1;
for(i=1;i<=n;i++)
{
f>>w>>p;
for(j=G;j>=0;j--)
{
if(v[j]>0&&v[j]+p>v[j+w])
{
v[j+w]=v[j]+p;
}
}
}
for(i=1;i<=G;i++)
if(v[i]>maxi)
maxi=v[i];
g<<maxi-1;
return 0;
}