제출 #1324365

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1324365		i_love_kim_ji_won	학교 설립 (IZhO13_school)	C++20	25 / 100	2095 ms	11660 KiB

school

// I ♡ 鞠婧祎
// #pragma GCC optimize("Ofast")
// #pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
#define freopen(name) if(fopen(name".INP","r")) {freopen (name".INP","r",stdin); freopen (name".OUT","w",stdout);}
using namespace std;

using ll = long long;

void justDoIt();

int main() {
    // freopen("");
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    justDoIt();
    return 0;
}

const int N = 3e5 + 5;

ll dp[105][105][105];
int a[N], b[N];

void test() {
    int n, m, s;
    cin >> n >> m >> s;
    for (int i = 1; i <= n; i++) {
        cin >> a[i] >> b[i];
    }
    for (int i = 1; i <= n; i++) {
        for (int j = 0; j <= m; j++) {
            for (int k = 0; k <= s; k++) {
                dp[i][j][k] = dp[i - 1][j][k];
                if (j > 0) {
                    dp[i][j][k] = max(dp[i][j][k], dp[i - 1][j - 1][k] + a[i]);
                }   
                if (k > 0) {
                    dp[i][j][k] = max(dp[i][j][k], dp[i - 1][j][k - 1] + b[i]);
                }
            }
        }
    }
    cout << dp[n][m][s];
}

void justDoIt() {
    int t = 1;
    // cin >> t;
    for (int tests = 1; tests <= t; tests++) {
        test();
    }
}

• Subtask 1: 25 / 100