제출 #481514

#제출 시각아이디문제언어결과실행 시간메모리
481514XenuxBest Place (NOI17_bestplace)C++17
100 / 100
40 ms1112 KiB
#include <bits/stdc++.h> using namespace std; typedef long long int ll; #define all(x) x.begin(), x.end() const int INF = 1e9+7; int main(){ ios::sync_with_stdio(false); cin.tie(NULL); int n; cin >> n; vector<int> x(n); vector<int> y(n); for(int i=0; i<n; i++){ cin >> x[i] >> y[i]; } sort(all(x)); sort(all(y)); int mid = n/2; int ans_x = x[mid]; int ans_y = y[mid]; cout << ans_x << " " << ans_y; return 0; }
#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...