#include "king.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll SendInfo(vector<int> W, vector<int> C) {
return 0;
}
#include "vassal.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
set<pair<int, int>> C;
void Init(ll B, vector<int> C_) {
int n = C_.size();
for (int i = 0; i < n; i++) {
C.emplace(C_[i], i);
}
// sort(C.begin(), C.end());
}
int Maid(int W) {
auto it = C.lower_bound(pair<int, int>(W + 1, 0));
if (it == C.begin()) return -1;
it = prev(it);
int ans = it->second;
if (W > it->first) return -1;
C.erase(it);
return ans;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
520 KB |
Wrong |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
32 ms |
6676 KB |
Wrong |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
40 ms |
6872 KB |
Wrong |
2 |
Halted |
0 ms |
0 KB |
- |