Cod sursa(job #2187278)
Utilizator | Data | 26 martie 2018 12:50:45 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int n,G,a[29999],b[29999],c[29999];
int main(){
fin>>n>>G;
for (int i=1;i<=n;i++)
fin>>a[i]>>b[i];
c[0]=0;
for (int i=1;i<=n;i++)
for(int j=G;j>=a[i];j--)
c[j]=max(c[j],c[j-a[i]]+b[i]);
fout<<c[G];
}