제출 #874150

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
874150		vjudge1	Kitchen (BOI19_kitchen)	C++17	29 / 100	27 ms	828 KiB

kitchen

#include <bits/stdc++.h>
using namespace std;
using i64 = long long;

const int MAXN = 300 + 5;

int dp[MAXN * MAXN];

#define ONLINE_JUDGE
void solve() {
    fill_n(&dp[0], MAXN * MAXN, int(-1E4));
    
    int n, m, k;
    cin >> n >> m >> k;

    vector <int> a(n);
    for(int &i : a)
        cin >> i;

    vector <int> b(m);
    for(int &i : b)
        cin >> i;

    bool ans = (k <= m);
    for(int &i : a)
        ans &= (k <= i);

    int suma = accumulate(a.begin(), a.end(), 0);
    ans &= (suma <= accumulate(b.begin(), b.end(), 0));

    if(!ans) {
        return cout << "Impossible", void();
    }

    dp[0] = 0;
    for(int i = 0; i < m; i++) {
        for(int j = MAXN * MAXN -1; j >= b[i]; j--) {
            dp[j] = max(dp[j], dp[j - b[i]] +1);
        }
    }

    int cev = MAXN * MAXN +1;
    for(int i = MAXN * MAXN -1; i >= suma; i--) {
        if(dp[i] >= k) {
            cev = i;
        }
    }

    if(cev == MAXN * MAXN +1)
        cout << "Impossible";
    else 
        cout << cev - suma;
    
    return;
}

signed main() {
    #ifndef ONLINE_JUDGE
        freopen(".in", "r", stdin);
        freopen(".out", "w", stdout);
    #endif

    ios_base::sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL);

    int t = 1; //cin >> t;
    for(int i = 1; i <= t; i++) {
        solve();
    }

    return 0;
}

• Subtask 1: 9 / 9
• Subtask 2: 0 / 22
• Subtask 3: 20 / 20
• Subtask 4: 0 / 21
• Subtask 5: 0 / 28