Submission #966360

#TimeUsernameProblemLanguageResultExecution timeMemory
966360njoopBest Place (NOI17_bestplace)C++14
36 / 100
27 ms1116 KiB
#include <bits/stdc++.h> #define ll long long using namespace std; int n, x[100010], y[100010], px, py; ll ax, ay, mnx, mny; int main() { cin.tie(0)->sync_with_stdio(0); cin >> n; for(int i=1; i<=n; i++) { cin >> x[i] >> y[i]; ax += x[i]; ay += y[i]; } sort(x+1, x+n+1); sort(y+1, y+n+1); mnx = ax; mny = ay; px = x[1]; py = y[1]; for(int i=2; i<=n; i++) { ax -= (n-i+1)*(x[i]-x[i-1]); ax += (i-1)*(x[i]-x[i-1]); if(mnx > ax) { ax = mnx; px = x[i]; } ay -= (n-i+1)*(y[i]-y[i-1]); ay += (i-1)*(y[i]-y[i-1]); if(mny > ay) { ay = mny; py = y[i]; } } cout << px << " " << py; 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...