제출 #567038

#제출 시각아이디문제언어결과실행 시간메모리
567038DodoKitchen (BOI19_kitchen)C++14
0 / 100
1 ms212 KiB
#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 arr[n]; for(int i=0;i<n;i++)cin>>arr[i]; deque<pair<ll,ll>>dq(m); for(int i=0;i<m;i++) { ll x; cin>>x; dq[i]={x,0}; } sort(dq.begin(),dq.end(),greater<pair<ll,ll>>()); for(int i=0;i<n;i++) { while(arr[i]!=0) { if(dq.size()==0) { cout<<"Impossible"; return 0; } if(dq.front().second==0) dq.front().second=1; ll x=dq.front().first; if(arr[i]>=x) { arr[i]-=x; dq.pop_front(); } else { dq[0].first-=arr[i]; arr[i]=0; } } } if(dq.front().second==0) cout<<0; else cout<<dq.front().first; 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...