제출 #966360

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
966360		njoop	Best Place (NOI17_bestplace)	C++14	36 / 100	27 ms	1116 KiB

bestplace

#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;
}

• Subtask 1: 3 / 3
• Subtask 2: 20 / 20
• Subtask 3: 0 / 28
• Subtask 4: 13 / 13
• Subtask 5: 0 / 17
• Subtask 6: 0 / 19