제출 #1174346

#제출 시각아이디문제언어결과실행 시간메모리
1174346lxz20071231Best Place (NOI17_bestplace)C++20
0 / 100
58 ms1092 KiB
#include <bits/stdc++.h> using namespace std; vector<int> x, y; int main () { int n; cin >> n; x.resize(n); y.resize(n); for (int i=0; i<n; i++){ cin >> x[i] >> y[i]; } sort(x.begin(), x.end()); sort(y.begin(), y.end()); cout << x[n/2] << y[n/2]; 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...