Cod sursa(job #2502354)
Utilizator | Data | 30 noiembrie 2019 18:33:07 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 65 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <iostream>
#include<bits/stdc++.h>
using namespace std;
ifstream in("rucsac.in");
ofstream out("rucsac.out");
int n, G, dp[5001];
int main()
{
in>>n>>G;
int w, p;
for(int i=1; i<=n; i++)
{
in>>w>>p;
for(int j=G; j>=w; j--)
if(dp[j]<dp[j-w]+p)
dp[j]=dp[j-w]+p;
}
out<<dp[G];
return 0;
}