Cod sursa(job #946263)
Utilizator | Data | 4 mai 2013 11:10:02 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 65 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <fstream>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int n,m,i,j,ma,gg,p,a[5001];
int main()
{
f>>n>>m;
for (i=1;i<=n;i++)
{
f>>gg>>p;
for (j=m;j>=gg;j--)
if(a[j]<a[j-gg]+p)
a[j]=a[j-gg]+p;
}
for (i=1;i<=m;i++)
if(a[i]>ma)ma=a[i];
g<<ma;
f.close();
g.close();
}