#include "grader.h"
#include <map>
#define ll long long
using namespace std;
map<ll,int>m;
void solve(int n){
for(int i=1;i<=n;i++){
int a=kth(i);
m[a]++;
}
for(auto it:m){
if(it.second>(n/3)){
m.clear();
say_answer(it.first);
return;
}
}
m.clear();
say_answer(-1);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
33 ms |
208 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Partially correct |
60 ms |
208 KB |
Output is partially correct |
2 |
Partially correct |
52 ms |
208 KB |
Output is partially correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Partially correct |
679 ms |
208 KB |
Output is partially correct |
2 |
Halted |
0 ms |
0 KB |
- |