#include <bits/stdc++.h>
#define L long long
using namespace std;
L SendInfo(vector<int>W, vector<int>C){
return 0;
}
#include <bits/stdc++.h>
#define L long long
using namespace std;
multiset<pair<int,int> >st;
void Init(L V, vector<int>C){
for(auto i:C){
st.insert(make_pair(C[i],i));
}
}
int Maid(int w){
multiset<pair<int,int> >::iterator it=st.lower_bound(make_pair(w,0));
if(it!=st.end())
{
int ret=it->second;
st.erase(it);
return ret;
}
return -1;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
10 ms |
1048 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
52 ms |
3636 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
52 ms |
3884 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |