# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
567208 | 2022-05-23T09:21:50 Z | Dodo | Kitchen (BOI19_kitchen) | C++14 | 1 ms | 212 KB |
#include <bits/stdc++.h> #define ll long long #define endl '\n' #define pb push_back using namespace std; const ll mx=1007, INF=1e18L+5; int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); ll n,m,k; cin>>n>>m>>k; ll sum=0; for(int i=0;i<n;i++) { ll x; cin>>x; sum+=x; } vector<ll>v; ll arr[m]; for(int i=0;i<m;i++) { ll x; cin>>x; arr[i]=x; } sort(arr,arr+m); for(ll bm=1;bm<(1<<m);bm++) { ll su=0; for(int i=0;i<m;i++) { if(bm&(1<<i))su+=arr[i]; } if(su>=sum)v.push_back(su); } sort(v.begin(),v.end()); ll u=lower_bound(v.begin(),v.end(),sum)-v.begin(); if(u!=v.size()) { cout<<sum-v[u]; } else cout<<"Impossible"; return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 212 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 212 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 212 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 212 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 212 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |