제출 #745911

#제출 시각아이디문제언어결과실행 시간메모리
745911vjudge1Kitchen (BOI19_kitchen)C++17
9 / 100
1 ms212 KiB
#include <bits/stdc++.h> using namespace std; using ll = long long int; const ll mod = 1e9 + 7; int main(){ int n, m, k; cin >> n >> m >> k; vector<ll> v(n), t(m); for(auto& i : v){ cin >> i; } for(auto& i : t){ cin >> i; } if(m < k || *min_element(begin(v), end(v)) < k){ cout << "Impossible" << endl; return 0; } if(k == 2 && *min_element(begin(t), end(t)) < 2){ cout << "Impossible" << endl; return 0; } int sumv = 0; for(auto& i : v){ sumv += i; } int sumt = 0; for(auto& i : t){ sumt += i; } if(sumt < sumv){ cout << "Impossible" << endl; return 0; } if(m == k){ cout << sumt - sumv << endl; return 0; } else{ int lossa = t[0] - sumv, lossb = t[1] - sumv; if(lossa > 0 && lossb > 0){ cout << min(lossa, lossb) << endl; return 0; } if(lossa > 0){ cout << lossa << endl; return 0; } if(lossb > 0){ cout << lossb << endl; return 0; } else{ cout << sumt - sumv << endl; return 0; } } return 0; }
#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...