제출 #746012

#제출 시각아이디문제언어결과실행 시간메모리
746012vjudge1Kitchen (BOI19_kitchen)C++17
0 / 100
1 ms212 KiB
#include <bits/stdc++.h> using namespace std; int n, m, k; int a[301]; int b[301]; int sum = 0; void st1(){ int ans = 1e9; if (m < k){cout << "Impossible\n"; return; } if (k == 1){ for (int i = 1;i <= m;i++){ if (b[i] >= sum) { ans = min(ans, b[i] - sum); } } int u = 0; for (int i = 1;i <= m; i++){ u += b[i]; } if (u >= sum) { ans = min(ans,u); } if (ans) cout << "Impossible\n"; else{ cout << ans-sum << "\n"; } return; }else if (k == 2) { int u = 0; for (int i = 1;i <= m; i++) { u += b[i]; } if (u >= sum) { ans = min(ans,u); } if (ans)cout << "Impossible\n"; else{ cout << ans-sum << "\n"; } return; }else{ cout << "Impossible\n"; return; } } int main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); cin >> n >> m >> k; for (int i = 1; i <= n; i++) { cin >> a[i]; sum += a[i]; } for (int i = 1;i <= m; i++) { cin >> b[i]; } if(m <= 2) st1(); }
#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...