Submission #1004319

#TimeUsernameProblemLanguageResultExecution timeMemory
10043190pt1mus23Kitchen (BOI19_kitchen)C++14
0 / 100
1 ms604 KiB
/* subtask check */ #pragma GCC optimize("O3", "inline") #include <bits/stdc++.h> using namespace std; #define ins insert #define pb push_back #define int long long int #define pii pair<int, int> #define endl '\n' #define drop(x) cout<<(x)<<endl; return; #define all(x) x.begin(),x.end() const int mod = 1e9 +7, sze = 1e5, inf = 2e18, prime = 23; void mal(){ int n,m,k; cin>>n>>m>>k; vector<int> arr(n); for(int i=0;i<n;i++){ cin>>arr[i]; } vector<int> chefs(m); for(int i=0;i<m;i++){ cin>>chefs[i]; } if(k==1){ multiset<int> lst; for(auto v:chefs){ lst.ins(v); } while(!lst.empty()){ int node = (*lst.begin()); lst.erase(lst.begin()); arr.back()-=node; if(arr.back()<0){ lst.insert(abs(arr.back())); arr.pop_back(); } } int ans=0; for(auto v:lst){ ans+=v; } drop(ans); } } signed main() { cin.tie(0)->sync_with_stdio(0); int tt = 1; // cin>>tt; while(tt--){ mal(); } }
#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...