제출 #1006027

#제출 시각아이디문제언어결과실행 시간메모리
1006027devariaotaBest Place (NOI17_bestplace)C++17
100 / 100
59 ms1208 KiB
#include <bits/stdc++.h> using namespace std; int main() { 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(x.begin(), x.end()); sort(y.begin(), y.end()); if (n % 2 == 0) { cout << (x[n/2] + x[n/2 - 1]) /2 << " " << (y[n/2] + y[n/2 - 1])/2; } else { cout << x[n/2] << " " << y[n/2]; } }
#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...