Submission #1198217

#TimeUsernameProblemLanguageResultExecution timeMemory
1198217agussKitchen (BOI19_kitchen)C++20
0 / 100
502 ms327680 KiB
#include <bits/stdc++.h> using namespace std; int main(){ int n, m, k, sum = 0; cin >> n >> m >> k; vector<int> dp; vector<int> b(m); for(int i = 0; i < n; i++){ int aux; cin >> aux; sum += aux; } for(int &i : b){ cin >> i; } sort(b.begin(), b.end()); dp.push_back(0); for(int i = 0; i < m; i++){ vector<int> aux; for(const int &x : dp){ aux.push_back(b[i] + x); } for(int &j : aux) dp.push_back(j); } auto c = lower_bound(dp.begin(), dp.end(), sum); if(c == dp.end()){ cout << "Impossible"; return 0; } int x = *c; cout << x - sum; 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...