# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
567318 | 2022-05-23T10:29:21 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; vector<ll>v(m); ll sum=0; for(int i=0;i<n;i++) { ll x; cin>>x; sum+=x; } for(int i=0;i<m;i++)cin>>v[i]; sort(v.begin(),v.end()); ll u=lower_bound(v.begin(),v.end(),sum)-v.begin(); ll ans=-1; if(u!=v.size()) ans=v[u]-sum; for(int i=1;i<m;i++) { v[i]+=v[i-1]; } u=lower_bound(v.begin(),v.end(),sum)-v.begin(); if(u==v.size()&&ans==-1)cout<<"Impossible"; else { ll x=v[u]; for(int i=0;i<u;i++) if(x-v[i]>=sum)x-=v[i]; x=x-sum; ans=max(ans,x); cout <<ans<<endl; } return 0; } /* 3 3 1 3 3 2 3 3 3 */
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Correct | 0 ms | 212 KB | Output is correct |
3 | Correct | 0 ms | 212 KB | Output is correct |
4 | Incorrect | 0 ms | 212 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Correct | 0 ms | 212 KB | Output is correct |
3 | Correct | 0 ms | 212 KB | Output is correct |
4 | Incorrect | 0 ms | 212 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Incorrect | 1 ms | 212 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 212 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Correct | 0 ms | 212 KB | Output is correct |
3 | Correct | 0 ms | 212 KB | Output is correct |
4 | Incorrect | 0 ms | 212 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |