Cod sursa(job #1982735)
Utilizator | Data | 20 mai 2017 08:10:22 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.3 kb |
#include<fstream>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
long a[100000],g1,j,n,i,w,p;
int main()
{
f>>n>>g1;
for(j=1;j<=n;j++)
{
f>>w>>p;
for(i=10000;i>=1;i--)
if(a[i+w]<a[i]+p) a[i+w]=a[i]+p;
if(a[w]<p) a[w]=p;
}
g<<a[g1];
f.close();
g.close();
return 0;
}