# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
746029 | vjudge1 | Kitchen (BOI19_kitchen) | C++14 | 29 ms | 300 KiB |
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(){
int n, m, k;
cin >> n >> m >> k;
vector<int> a(n), b(m);
int csum = 0, mmm = k;
for(int i = 0; i < n; i++){
cin >> a[i];
csum += a[i];
mmm = min(mmm, a[i]);
}
for(int i = 0; i < m; i++){
cin >> b[i];
}
if(mmm < k){
cout << "Impossible\n";
return 0;
}
int ans = INT_MAX;
int ketto[20];
ketto[0] = 1;
for(int i = 1; i < 20; i++){
ketto[i] = 2 * ketto[i - 1];
}
for(int i = 0; i < ketto[m]; i++){
int sum = 0;
for(int j = 0; j < m; j++){
if(ketto[j] & i){
# | 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... |