제출 #377315

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
377315		hhh07	Kitchen (BOI19_kitchen)	C++14	0 / 100	248 ms	3820 KiB

kitchen

#include <iostream>
#include <algorithm>
#include <cmath>
#include <map>
#include <climits>
#include <vector>
#include <queue>
#include <utility>
#include <iomanip>
#include <cstring>
#include <fstream>

using namespace std;

typedef unsigned long long ll;
typedef pair<ll, ll> ii;

ll maks = LLONG_MAX;

ll nnad2(int n){
    return n*(n-1)/2;
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int n, m, k;
    cin >> n >> m >> k;
    int a[n], b[m];
    int sum = 0;
    for (int i = 0; i < n; i++){
        cin >> a[i];
        sum += a[i];
        if (a[i] < k){
            cout << "Impossible";
            return 0;
        }
    }
    for (int i = 0; i < m; i++)
        cin >> b[i];
    
    if (k > m){
        cout << "Impossible";
        return 0;
    }
    
    vector<int> dp(900001, -1e5);
    dp[0] = 0;
    for (int i = 0; i < m; i++){
        for (int j = 900000 - b[i]; j >= 0 ; j--){
            dp[j + b[i]] = max(dp[j + b[i]], dp[j] + min(n, b[i]));
        }
    }
    
    for (int i = sum; i < 30; i++){
        if (dp[i] >= n*k){
            cout << i - sum << endl;
            return 0;
        }
    }
    cout << "Impossible";
    return 0;

}

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