Submission #505898

#TimeUsernameProblemLanguageResultExecution timeMemory
505898Carmel_Ab1King of Chairs (FXCUP4_chairs)C++17
95 / 100
138 ms14708 KiB
#include "king.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; typedef vector<int> vi; #define all(x) x.begin(),x.end() ll SendInfo(vi W, vi C) { sort(all(W)); sort(all(C)); int n=C.size(); multiset<int>s; for(int i=0; i<n; i++) s.insert(C[i]); int ans=0; for(int i=0; i<n; i++){ auto it=s.lower_bound(W[i]); if(it==s.end())break; ans=*it; s.erase(it); } return ans/16; }
#include "vassal.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; typedef vector<int> vi; typedef pair<int,int>pi; int mx=0; multiset<pi>s; void Init(ll B, vi C){ mx=16*B+15; int n=C.size(); for(int i=0; i<n; i++) s.insert({C[i],i}); } int Maid(int W){ if(W>mx)return -1; auto it=s.upper_bound({W,-1}); if(it==s.end())return -1; int ans=it->second; s.erase(it); return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...