제출 #1109393

#제출 시각아이디문제언어결과실행 시간메모리
1109393IrateBest Place (NOI17_bestplace)C++17
48 / 100
57 ms3144 KiB
#include <bits/stdc++.h> using namespace std; int main() { // (X_median, 0) // // (X[1], Y[1]) // (X[2], Y[2]) // (X[3], Y[3]) // ... // (X[n], Y[n]) int n; cin >> n; vector<int>x(n), y(n); for(int i = 0;i < n;++i){ cin >> x[i] >> y[i]; } sort(x.begin(), x.end()); cout << x[n / 2] << " " << 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...