제출 #1183126

#제출 시각아이디문제언어결과실행 시간메모리
1183126emptypringlescanKing of Chairs (FXCUP4_chairs)C++20
100 / 100
70 ms6216 KiB
#include "king.h" long long SendInfo(std::vector<int> W, std::vector<int> C) { //average king return 0; }
#include "vassal.h" #include <bits/stdc++.h> using namespace std; long long BB; multiset<pair<int,int> > yey; multiset<pair<int,int> >::iterator it; void Init(long long B, std::vector<int> C){ int N = C.size(); BB = B; for(int i=0; i<N; i++) yey.insert({C[i],i}); } int Maid(int W){ it=yey.lower_bound({W,-1}); if(it==yey.end()) return -1; int ret=it->second; yey.erase(it); return ret; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...