Cod sursa(job #1955048)
Utilizator | Data | 5 aprilie 2017 19:49:50 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int n,m,g,c,a[10003],Max;
int main()
{
fin>>n>>m;
for(int i=1;i<=n;i++)
{
fin>>g>>c;
for(int j=m;j>=g;j--)
if(a[j-g]+c>a[j])
a[j]=a[j-g]+c;
}
for(int i=1;i<=m;i++)
if(Max<a[i])
Max=a[i];
fout<<Max;
return 0;
}