Cod sursa(job #2652359)
Utilizator | Data | 24 septembrie 2020 19:23:09 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int n, dp[10003], grmx, grcrt, valcrt;
int main()
{
f>>n>>grmx;
for(int i=1; i<=n; i++)
{
f>>grcrt>>valcrt;
for(int j=grmx; j>=grcrt; j--)
dp[j]=max( dp[j-grcrt]+valcrt, dp[j]);
}
return 0;
}