#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, 0));
if (it == C.end()) return -1;
int ans = it->second;
C.erase(it);
return ans;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
508 KB |
Correct |
2 |
Correct |
1 ms |
512 KB |
Correct |
3 |
Correct |
1 ms |
520 KB |
Correct |
4 |
Correct |
1 ms |
596 KB |
Correct |
5 |
Correct |
1 ms |
520 KB |
Correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
30 ms |
5388 KB |
Correct |
2 |
Correct |
61 ms |
11560 KB |
Correct |
3 |
Correct |
65 ms |
12680 KB |
Correct |
4 |
Correct |
64 ms |
12580 KB |
Correct |
5 |
Correct |
61 ms |
12560 KB |
Correct |
6 |
Correct |
61 ms |
12572 KB |
Correct |
7 |
Correct |
61 ms |
12608 KB |
Correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
39 ms |
5444 KB |
Correct |
2 |
Correct |
71 ms |
11696 KB |
Correct |
3 |
Correct |
70 ms |
12568 KB |
Correct |
4 |
Correct |
81 ms |
12572 KB |
Correct |
5 |
Correct |
88 ms |
12592 KB |
Correct |
6 |
Correct |
85 ms |
12692 KB |
Correct |
7 |
Correct |
70 ms |
12680 KB |
Correct |
8 |
Correct |
83 ms |
12584 KB |
Correct |