#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<long long> vi;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
ll n;
cin >> n;
vi posx = {};
vi posy = {};
for (int i = 0; i < n; i++) {
ll temp1, temp2;
cin >> temp1 >> temp2;
posx.push_back(temp1);
posy.push_back(temp2);
}
sort(posx.begin(), posx.end());
sort(posy.begin(), posy.end());
if (n%2==0) cout << posx[n/2] << " " << posy[n/2] << "\n";
else cout << posx[(n-1)/2] << " " << posy[(n-1)/2] << "\n";
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Correct |
0 ms |
204 KB |
Output is correct |
3 |
Correct |
0 ms |
204 KB |
Output is correct |
4 |
Correct |
0 ms |
204 KB |
Output is correct |
5 |
Correct |
0 ms |
204 KB |
Output is correct |
6 |
Correct |
0 ms |
204 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
332 KB |
Output is correct |
2 |
Correct |
0 ms |
332 KB |
Output is correct |
3 |
Correct |
1 ms |
332 KB |
Output is correct |
4 |
Correct |
1 ms |
332 KB |
Output is correct |
5 |
Correct |
0 ms |
332 KB |
Output is correct |
6 |
Correct |
1 ms |
332 KB |
Output is correct |
7 |
Correct |
0 ms |
332 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
16 ms |
2004 KB |
Output is correct |
2 |
Correct |
22 ms |
2096 KB |
Output is correct |
3 |
Correct |
21 ms |
2104 KB |
Output is correct |
4 |
Correct |
16 ms |
2104 KB |
Output is correct |
5 |
Correct |
20 ms |
2104 KB |
Output is correct |
6 |
Correct |
22 ms |
2080 KB |
Output is correct |
7 |
Correct |
22 ms |
2064 KB |
Output is correct |
8 |
Correct |
21 ms |
2104 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Correct |
0 ms |
204 KB |
Output is correct |
3 |
Correct |
0 ms |
204 KB |
Output is correct |
4 |
Correct |
0 ms |
204 KB |
Output is correct |
5 |
Correct |
0 ms |
204 KB |
Output is correct |
6 |
Correct |
0 ms |
204 KB |
Output is correct |
7 |
Correct |
0 ms |
204 KB |
Output is correct |
8 |
Correct |
0 ms |
204 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
332 KB |
Output is correct |
2 |
Correct |
1 ms |
332 KB |
Output is correct |
3 |
Correct |
0 ms |
332 KB |
Output is correct |
4 |
Correct |
1 ms |
332 KB |
Output is correct |
5 |
Correct |
1 ms |
316 KB |
Output is correct |
6 |
Correct |
1 ms |
332 KB |
Output is correct |
7 |
Correct |
1 ms |
332 KB |
Output is correct |
8 |
Correct |
1 ms |
332 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
34 ms |
2104 KB |
Output is correct |
2 |
Correct |
32 ms |
2004 KB |
Output is correct |
3 |
Correct |
22 ms |
2104 KB |
Output is correct |
4 |
Correct |
29 ms |
2040 KB |
Output is correct |
5 |
Correct |
32 ms |
2012 KB |
Output is correct |
6 |
Correct |
32 ms |
2104 KB |
Output is correct |
7 |
Correct |
32 ms |
2104 KB |
Output is correct |
8 |
Correct |
32 ms |
2048 KB |
Output is correct |