#include "king.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
long long SendInfo(std::vector<int> W, std::vector<int> C) {
vector<int> orig = C;
sort(W.begin() , W.end());
sort(C.rbegin() , C.rend());
ll last = 0LL;
for(int i = 0 ; i < W.size() ; i ++){
while(C.size() && C.back() < W[i]){
C.pop_back();
}
// cout<<i<<" " << C.back() << endl;
if(!C.size()){
last = W[i];
break;
}
else{
C.pop_back();
}
}
// cout<<last<<endl ;
if(last == 0) return ((int) W.size());
if(last > orig.back()){
return 0;
}
else{
for(int i = 0 ; i < W.size() ; i ++){
if(orig[i] < last){
last = i;
}
}
return last + 1;
}
}
#include "vassal.h"
#include <bits/stdc++.h>
using namespace std;
#define pii pair<int,int>
#define F first
#define S second
long long BB;
vector<int> c;
set<pii> Sx;
void Init(long long B, std::vector<int> C){
int N = C.size();
BB = B;
c = C;
for(int i =0 ; i < C.size() ; i ++){
Sx.insert(pair<int,int>(C[i] , i));
}
// ToDo
}
int Maid(int W){
if(( BB != 0 && W > c[BB-1]) || (W > c.back())){
return -1;
}
else{
auto u = Sx.lower_bound(pii(W , -1));
pii X = *u;
Sx.erase(X);
// cout<<W<<" " <<X.second << endl;
return X.second;
}
}
Compilation message
king.cpp: In function 'long long int SendInfo(std::vector<int>, std::vector<int>)':
king.cpp:13:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i = 0 ; i < W.size() ; i ++){
~~^~~~~~~~~~~
king.cpp:32:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i = 0 ; i < W.size() ; i ++){
~~^~~~~~~~~~
vassal.cpp: In function 'void Init(long long int, std::vector<int>)':
vassal.cpp:15:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i =0 ; i < C.size() ; i ++){
~~^~~~~~~~~~
vassal.cpp:12:6: warning: unused variable 'N' [-Wunused-variable]
int N = C.size();
^
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
10 ms |
1036 KB |
Correct |
2 |
Incorrect |
11 ms |
1200 KB |
Wrong |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
62 ms |
5968 KB |
Wrong |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
73 ms |
5924 KB |
Wrong |
2 |
Halted |
0 ms |
0 KB |
- |