This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, m, k, requiredHours = 0;
cin >> n >> m >> k;
vector<int> meals(n), chefs(m);
for (int & x : meals) {
cin >> x;
if (x < k){
cout << "Impossible" << '\n';
return 0;
}
requiredHours += x;
}
for (int & x : chefs) cin >> x;
vector<bool> snack(300*300+1, false);
snack[0] = true;
for (int i = 0; i < m; i++){
for (int j = 300*300; j >= 0; j--){
if (snack[j]) snack[j + chefs[i]] = true;
}
}
int mo = requiredHours;
while(true){
if (snack[mo]) break;
mo++;
}
cout << mo - requiredHours << endl;
return 0;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |