Submission #1198215

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