Cod sursa(job #2575934)
Utilizator | Data | 6 martie 2020 16:18:23 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <bits/stdc++.h>
#define MAX 5100
using namespace std;
ifstream fin("concurs.in");
ofstream fout("concurs.out");
int c[MAX],g[MAX],n,G;
int cmax[MAX];
int main()
{
int i,x;
fin>>n>>G;
for(i=1;i<=n;i++)
fin>>g[i]>>c[i];
for(i=1;i<=n;i++)
for(x=G;x>=g[i];x--)
if(cmax[x]<c[i]+cmax[x-g[i]])
cmax[x]=c[i]+cmax[x-g[i]];
fout<<cmax[G];
return 0;
}