Cod sursa(job #3131506)
| Utilizator | Data | 20 mai 2023 14:01:41 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <bits/stdc++.h>
#define mod 666013
using namespace std;
int n,g,w[10005],p[10005],dp[10005];
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int rucsac(int n, int g){
for (int i=1;i<=n;i++){
for (int j=g;j>=w[i];j--){
dp[j]=max(dp[j],dp[j-w[i]]+p[i]);
}
}
int rez=0;
for (int j=0;j<=g;j++)
rez=max(rez,dp[j]);
return rez;
}
int main(){
fin>>n>>g;
for (int i=1;i<=n;i++) fin>>w[i]>>p[i];
int rez=0;
rez=max(rez, rucsac(n,g));
fout<<rez;
}