#include "king.h"
long long SendInfo(std::vector<int> W, std::vector<int> C) {
return 0;
}
#include "vassal.h"
#include <set>
using namespace std;
set<pair<int,int>> sets;
void Init(long long B, std::vector<int> C){
int i=0;
for(auto &x: C) sets.insert(make_pair(x,i++));
}
int Maid(int W){
auto it = sets.lower_bound(make_pair(W,0));
if(it == sets.end()) return -1;
int v=it->second; sets.erase(it);
return v;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
4 ms |
644 KB |
Correct |
2 |
Correct |
4 ms |
784 KB |
Correct |
3 |
Correct |
4 ms |
896 KB |
Correct |
4 |
Correct |
4 ms |
720 KB |
Correct |
5 |
Correct |
4 ms |
636 KB |
Correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
55 ms |
6960 KB |
Correct |
2 |
Correct |
98 ms |
11320 KB |
Correct |
3 |
Correct |
107 ms |
12100 KB |
Correct |
4 |
Correct |
110 ms |
12072 KB |
Correct |
5 |
Correct |
108 ms |
12820 KB |
Correct |
6 |
Correct |
106 ms |
12876 KB |
Correct |
7 |
Correct |
107 ms |
13020 KB |
Correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
72 ms |
7004 KB |
Correct |
2 |
Correct |
136 ms |
11984 KB |
Correct |
3 |
Correct |
130 ms |
12908 KB |
Correct |
4 |
Correct |
150 ms |
12904 KB |
Correct |
5 |
Correct |
155 ms |
12936 KB |
Correct |
6 |
Correct |
177 ms |
12880 KB |
Correct |
7 |
Correct |
130 ms |
12912 KB |
Correct |
8 |
Correct |
123 ms |
12784 KB |
Correct |