제출 #781028

#제출 시각아이디문제언어결과실행 시간메모리
781028ymmBest Place (NOI17_bestplace)C++17
100 / 100
33 ms3308 KiB
#include <bits/stdc++.h> #define Loop(x,l,r) for (ll x = (l); x < (ll)(r); ++x) #define LoopR(x,l,r) for (ll x = (r)-1; x >= (ll)(l); --x) typedef long long ll; typedef std::pair<int, int> pii; typedef std::pair<ll , ll > pll; using namespace std; int main() { cin.tie(0) -> sync_with_stdio(false); int n; cin >> n; vector<int> X, Y; Loop (i,0,n) { int x, y; cin >> x >> y; X.push_back(x); Y.push_back(y); } sort(X.begin(), X.end()); sort(Y.begin(), Y.end()); cout << X[X.size()/2] << ' ' << Y[Y.size()/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...