제출 #584264

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
584264		talant117408	Kitchen (BOI19_kitchen)	C++17	0 / 100	6 ms	328 KiB

kitchen

#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;

#define long                unsigned long 
#define pb                  push_back
#define mp                  make_pair
#define all(v)              (v).begin(),(v).end()
#define rall(v)             (v).rbegin(),(v).rend()
#define lb                  lower_bound
#define ub                  upper_bound
#define sz(v)               int((v).size())
#define do_not_disturb      ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define endl                '\n'

void impossible() {
    cout << "impossible" << endl;
    exit(0);
}

void solve() {
    int n, m, k;
    cin >> n >> m >> k;
    vector <int> a(n), b(m);
    for (auto &to : a) cin >> to;
    for (auto &to : b) cin >> to;
    if (m < k) impossible();
    for (auto to : a) {
        if (to < k) impossible();
    }
    int dishes = 0;
    for (auto to : a) dishes += to;
    sort(all(b));
    for (int chefs = k; chefs <= m; chefs++) {
        for (int start = 0; start + chefs - 1 < m; start++) {
            int ans = 0;
            for (int i = 0; i < chefs - 1; i++) {
                ans += b[start + i];
            }
            for (int i = start + chefs - 1; i < m; i++) {
                if (ans + b[i] >= dishes) {
                    cout << ans + b[i] - dishes;
                    exit(0);
                }
            }
        }
    }
    impossible();
}

int main() {
    do_not_disturb
    
    int t = 1;
    //~ cin >> t;
    while (t--) {
        solve();
    }
    
    return 0;
}

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