#include <bits/stdc++.h>
using namespace std;
#define ll long long int
// Added
#define True true
#define False false
#define endl "\n"
void solve() {
ll n;
cin >> n;
vector<ll> x(n);
vector<ll> y(n);
for (ll i = 0; i < n; ++i) cin >> x[i] >> y[i];
std::sort(x.begin(), x.end());
std::sort(y.begin(), y.end());
cout << x[ceil(n/2)] << " " << y[ceil(n/2)] << endl;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
solve();
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
0 ms |
204 KB |
Output is correct |
3 |
Correct |
1 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 |
1 ms |
204 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Correct |
1 ms |
332 KB |
Output is correct |
4 |
Correct |
1 ms |
332 KB |
Output is correct |
5 |
Correct |
1 ms |
332 KB |
Output is correct |
6 |
Correct |
1 ms |
332 KB |
Output is correct |
7 |
Correct |
1 ms |
332 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
17 ms |
1892 KB |
Output is correct |
2 |
Correct |
21 ms |
1900 KB |
Output is correct |
3 |
Correct |
23 ms |
1868 KB |
Output is correct |
4 |
Correct |
25 ms |
3020 KB |
Output is correct |
5 |
Correct |
22 ms |
3020 KB |
Output is correct |
6 |
Correct |
22 ms |
3052 KB |
Output is correct |
7 |
Correct |
22 ms |
2900 KB |
Output is correct |
8 |
Correct |
21 ms |
3032 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
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 |
312 KB |
Output is correct |
5 |
Correct |
1 ms |
204 KB |
Output is correct |
6 |
Correct |
1 ms |
204 KB |
Output is correct |
7 |
Correct |
0 ms |
204 KB |
Output is correct |
8 |
Correct |
1 ms |
312 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Correct |
1 ms |
332 KB |
Output is correct |
4 |
Correct |
1 ms |
328 KB |
Output is correct |
5 |
Correct |
1 ms |
332 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 |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
31 ms |
1884 KB |
Output is correct |
2 |
Correct |
32 ms |
1868 KB |
Output is correct |
3 |
Correct |
25 ms |
3792 KB |
Output is correct |
4 |
Correct |
29 ms |
3032 KB |
Output is correct |
5 |
Correct |
33 ms |
3792 KB |
Output is correct |
6 |
Correct |
38 ms |
3788 KB |
Output is correct |
7 |
Correct |
36 ms |
3796 KB |
Output is correct |
8 |
Correct |
37 ms |
3804 KB |
Output is correct |