제출 #567031

#제출 시각아이디문제언어결과실행 시간메모리
567031RealSnakeKitchen (BOI19_kitchen)C++14
0 / 100
1 ms212 KiB
#include "bits/stdc++.h" using namespace std; #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> using namespace __gnu_pbds; typedef tree<pair<int, int>, null_type, less<pair<int,int>>, rb_tree_tag, tree_order_statistics_node_update> ordered_set; #define ll long long #define mod 1000000007 ofstream fout(".out"); ifstream fin(".in"); signed main() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int n, m, k; cin >> n >> m >> k; int a[n], b[m]; for(int i = 0; i < n; i++) cin >> a[i]; for(int i = 0; i < m; i++) cin >> b[i]; if(m <= 2) { int x = 0; for(int i = 0; i < n; i++) x += a[i]; sort(b, b + m); if(k == 1) { if(b[0] >= x) { cout << b[0] - x; return 0; } if(m > 1 && b[1] >= x) { cout << b[1] - x; return 0; } } for(int j = 0; j < m; j++) x -= b[j]; if(m >= k && x <= 0) { if(k == 1 || b[0] >= n) { cout << abs(x); return 0; } } cout << "Impossible"; 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...