This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "king.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll SendInfo(vector<int> W, vector<int> C) {
return 0;
}
#include "vassal.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
set<pair<int, int> > st;
void Init(long long B, vector<int> C){
int n = C.size();
for(int i=0; i<n; i++) st.insert(make_pair(C[i], i));
}
int Maid(int W){
auto it = st.lower_bound(make_pair(W, -1));
if(it == st.end()) return -1;
int ret = it->second;
st.erase(it);
return ret;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |