Submission #1297076

#TimeUsernameProblemLanguageResultExecution timeMemory
1297076Zone_zoneeKitchen (BOI19_kitchen)C++20
0 / 100
1 ms572 KiB
#include <bits/stdc++.h>
using namespace std;
const int N = 310;

int a[N], b[N];
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int n, m, k;
    cin >> n >> m >> k;
    if(m < k) {
        cout << "Impossible\n";
        return 0;
    }
    for(int i = 0; i < n; ++i){
        cin >> a[i];
        if(k > a[i]) {
            cout << "Impossible\n";
            return 0;
        }
    }
    for(int i = 0; i < m; ++i){
        cin >> b[i];
    }
    int ans = 0;
    for(int i = 0; i < n; ++i){
        if(k == 1){
            if(b[0] >= a[i] && b[1] >= a[i]){
                ans += min(b[0], b[1]) - a[i];
            }else if(b[0] >= a[i]) ans += b[0] - a[i];
            else if(b[1] >= a[i]) ans += b[1] - a[i];
            else if(b[0]+b[1] >= a[i]) ans += b[0]+b[1]-a[i];
            else{
                cout << "Impossible\n";
                return 0;
            }
        }else{
            if(b[0]+b[1] >= a[i]) ans += b[0]+b[1]-a[i];
            else{
                cout << "Impossible\n";
                return 0;
            }
        }
    }
    cout << ans << '\n';
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...