#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
vector<pair<int,int>> posi(n+1);
for(int i=1;i<=n;i++){
cin>>posi[i].first>>posi[i].second;
}
sort(posi.begin(),posi.end());
cout<<posi[n/2+1].first<<' '<<0;
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
348 KB |
Output is correct |
2 |
Correct |
1 ms |
348 KB |
Output is correct |
3 |
Correct |
1 ms |
748 KB |
Output is correct |
4 |
Correct |
1 ms |
348 KB |
Output is correct |
5 |
Correct |
1 ms |
348 KB |
Output is correct |
6 |
Correct |
1 ms |
348 KB |
Output is correct |
7 |
Correct |
1 ms |
348 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
38 ms |
1116 KB |
Output is correct |
2 |
Correct |
49 ms |
1204 KB |
Output is correct |
3 |
Correct |
45 ms |
1452 KB |
Output is correct |
4 |
Correct |
42 ms |
1116 KB |
Output is correct |
5 |
Correct |
53 ms |
1360 KB |
Output is correct |
6 |
Correct |
56 ms |
1116 KB |
Output is correct |
7 |
Correct |
44 ms |
1116 KB |
Output is correct |
8 |
Correct |
45 ms |
1116 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
60 ms |
1112 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |