Cod sursa(job #2555366)
| Utilizator | Data | 23 februarie 2020 22:08:11 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.63 kb |
#include <fstream>
using namespace std;
struct ob
{
int g,v;
}x[5001];
int a[10001];
int main()
{
ifstream fin ("rucsac.in");
ofstream fout ("rucsac.out");
int n,gmax,vmax=0;
fin>>n>>gmax;
for (int i=1;i<=n;i++)
fin>>x[i].g>>x[i].v;
for (int i=1;i<=gmax;i++)
a[i]=-1;
for (int i=1;i<=n;i++)
for (int j=gmax-x[i].g;j>=0;j--)
if (a[j]!=-1)
if (a[j+x[i].g]<a[j]+x[i].v)
a[j+x[i].g]=a[j]+x[i].v;
for (int i=1;i<=gmax;i++)
if (a[i]>vmax)
vmax=a[i];
fout<<vmax;
return 0;
}
