Cod sursa(job #2272359)

Utilizator TooHappyMarchitan Teodor TooHappy Data 30 octombrie 2018 08:46:00
Problema Problema rucsacului Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.75 kb
#include <bits/stdc++.h>
using namespace std;

ifstream in("rucsac.in");
ofstream out("rucsac.out");

int DP[2][10010];

struct obiect {
    int w, p;
};

int main() {
    ios::sync_with_stdio(false); in.tie(0); out.tie(0);

    int n, g; in >> n >> g;

    vector< obiect > obiecte(n + 1);
    for(int i = 1; i <= n; ++i) {
        in >> obiecte[i].w >> obiecte[i].p;
    }

    for(int i = 1; i <= n; ++i) {
        for(int j = 0; j < obiecte[i].w; ++j) {
            DP[i % 2][j] = DP[abs(i % 2 - 1)][j];
        }

        for(int j = obiecte[i].w; j <= g; ++j) {
            DP[i % 2][j] = max(DP[abs(i % 2 - 1)][j], obiecte[i].p + DP[abs(i % 2 - 1)][j - obiecte[i].w]);
        }
    }

    out << DP[n % 2][g] << "\n";

    in.close(); out.close();

    return 0;
}