제출 #1303168

#제출 시각아이디문제언어결과실행 시간메모리
1303168stephenelevenBest Place (NOI17_bestplace)C++20
100 / 100
27 ms4024 KiB
#include <bits/stdc++.h> using namespace std; #define int long long const int maxn = 1e5; int n, x[maxn + 5], y[maxn + 5]; signed main(){ ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> n; for(int i = 1; i <= n; ++i){ cin >> x[i] >> y[i]; } sort(x + 1, x + n + 1); sort(y + 1, y + n + 1); cout << x[(n + 1)/2] << ' ' << y[(n + 1)/2] << '\n'; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...