제출 #1198212

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1198212		aguss	Kitchen (BOI19_kitchen)	C++20	0 / 100	883 ms	327680 KiB

kitchen

#include <bits/stdc++.h>
using namespace std;
int main(){
    int n, m, k, sum = 0;
    cin >> n >> m >> k;
    vector<int> b(m);
    vector<map<int, int>> dp(m);
    for(int i = 0; i < n; i++){
        int aux;
        cin >> aux;
        sum += aux;
    }
    for(int &i : b){
        cin >> i;
    }
    sort(b.begin(), b.end());
    for(int i = 0; i < m; i++){
        dp[i][b[i]] = 1;
    }
    for(int i = 1; i < m; i++){
        for(const auto &[x, y] : dp[i - 1]){
            dp[i][b[i] + x] = 1;
            dp[i][x] = 1;
        }
    }
    map<int, int>::iterator c = dp[m - 1].lower_bound(sum);
    if(c == dp[m - 1].end()){
        cout << "Impossible";
        return 0;
    } 
    int x = c->first;
    cout << x - sum;
    return 0;
}

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