Cod sursa(job #948511)
Utilizator | Data | 10 mai 2013 18:26:28 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include<fstream>
using namespace std;
int n,i,w[50001],p[50001],G,a[50001],j;
int max(int a,int b)
{
if(a>b)
return a;
else
return b;
}
int main()
{
ifstream f("rucsac.in");
ofstream g("rucsac.out");
f>>n>>G;
for(i=1;i<=n;i++)
f>>w[i]>>p[i];
for(i=1;i<=n;i++)
for(j=G;j>=w[i];j--)
a[j]=max(a[j],(a[j-w[i]]+p[i]));
g<<a[G];
}