Submission #949178

#TimeUsernameProblemLanguageResultExecution timeMemory
949178vjudge1Best Place (NOI17_bestplace)C++17
100 / 100
31 ms2020 KiB
#include <bits/stdc++.h> using namespace std; #define int long long #define size(x) (int)x.size() #define all(x) x.begin(), x.end() template<class S, class T> bool chmin(S& a, const T& b) { return a > b ? (a = b) == b : false; } template<class S, class T> bool chmax(S& a, const T& b) { return a < b ? (a = b) == b : false; } signed main() { cin.tie(nullptr)->sync_with_stdio(false); int n; cin >> n; int x[n], y[n]; for (int i = 0; i < n; ++i) { cin >> x[i] >> y[i]; } sort(x, x + n), sort(y, y + n); int res = 0; for (int i = 0; i < n; ++i) { res += abs(x[i] - x[n / 2]); res += abs(y[i] - y[n / 2]); } 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...