Submission #1264107

#TimeUsernameProblemLanguageResultExecution timeMemory
1264107rtriKitchen (BOI19_kitchen)C++20
0 / 100
1 ms396 KiB
#include <bits/stdc++.h> using namespace std; int cost = 0; int n, m, k; vector<int> meals, possible_chefs; bool possible(vector<int> chefs) { for (int i = 0; i < n; i++) { sort(chefs.rbegin(), chefs.rend()); if (meals[i] < k) return false; for (int j = 0; j < k; j++) { if (chefs[j] == 0) return false; chefs[j]--; } } return true; } int main() { cin >> n >> m >> k; meals.resize(n); for (int i = 0; i < n; i++) { cin >> meals[i]; cost += meals[i]; } possible_chefs.resize(m); for (int i = 0; i < m; i++) cin >> possible_chefs[i]; int ans = 1e9; for (int mask = 1; mask <= (1 << m); mask++) { if (__builtin_popcount(mask) < k) continue; vector<int> chefs; int sum = 0; for (int i = 0; i < m; i++) if (1 & (mask >> i)) { chefs.push_back(possible_chefs[i]); sum += possible_chefs[i]; } if (cost <= sum && possible(chefs)) ans = min(ans, sum - cost); } if (ans == 1e9) cout << "impossible" << endl; else cout << ans << endl; 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...