#include<bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
vector<pair<int, int>>v(n);
for(int i = 0;i < n;++i){
cin >> v[i].first >> v[i].second;
}
sort(v.begin(), v.end());
cout << v[n / 2].first << " " << 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
1 ms |
348 KB |
Output is correct |
3 |
Correct |
1 ms |
348 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 |
12 ms |
1112 KB |
Output is correct |
2 |
Correct |
18 ms |
1116 KB |
Output is correct |
3 |
Correct |
18 ms |
1116 KB |
Output is correct |
4 |
Correct |
13 ms |
2392 KB |
Output is correct |
5 |
Correct |
20 ms |
2396 KB |
Output is correct |
6 |
Correct |
18 ms |
2396 KB |
Output is correct |
7 |
Correct |
19 ms |
2136 KB |
Output is correct |
8 |
Correct |
18 ms |
2396 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
21 ms |
1112 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |