Submission #1004121

#	Time	Username	Problem	Language	Result	Execution time	Memory
1004121		vjudge1	Kitchen (BOI19_kitchen)	C++17	0 / 100	0 ms	348 KiB

kitchen

/*
    subtask : 3
*/
#pragma GCC optimize("O3", "inline")
#include <bits/stdc++.h>
using namespace std;
#define ins insert
#define pb push_back
#define int long long int
#define pii pair<int, int>
#define endl '\n'
#define drop(x) cout<<(x)<<endl; return;
#define all(x) x.begin(),x.end()
const int mod = 1e9 +7, sze = 1e5, inf = 2e18, prime = 23;

void mal(){
    int n,m,k;
    cin>>n>>m>>k;
    vector<int> arr(n);
    for(int i=0;i<n;i++){
        cin>>arr[i];
    }
    vector<int> chefs(m);
    for(int i=0;i<m;i++){
        cin>>chefs[i];
    } 
    if(m<=2){
        multiset<int> lst;
        int sum=0;
        int sumb =0;
        for(auto v:arr){
            sum+=v;
        }
        for(auto v:chefs){
            sumb+=v;
        }
        if(m==1){
            if(sumb<sum || k==2){
                drop("Impossible");
            }
            drop(sumb-sum);
        }
        else if(m==2){
            // cout<<arr[0]<<" "<<arr[1]<<endl;
            if(sumb<sum || (k==2 && min(chefs[0],chefs[1])<n)){
                drop("Impossible");
            }
            drop(sumb - sum);

        }
        int ans = sumb - sum;

        drop(ans);
        return;
    }


}   

signed main() {
    cin.tie(0)->sync_with_stdio(0);
    int tt = 1;
    // cin>>tt;
    
    while(tt--){
        mal();        
    }
}

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