Submission #1109405

#	Time	Username	Problem	Language	Result	Execution time	Memory
1109405		Irate	Best Place (NOI17_bestplace)	C++17	100 / 100	65 ms	3144 KiB

bestplace

#include <bits/stdc++.h>
using namespace std;

int main()
{
//    (X, Y)
//
//    (X[1], Y[1])
//    (X[2], Y[2])
//    (X[3], Y[3])
//    ...
//    (X[n], Y[n])
//
//    |X[1] - X| + |Y[1] - Y| +
//    |X[2] - X| + |Y[2] - Y| +
//    ...
//    |X[n] - X| + |Y[n] - Y|
//
//
//    |X[1] - X| + |X[2] - X| + |X[3] - X| + ... + |X[n] - X| = X_cem
//
//    |Y[1] - Y| + |Y[2] - Y| + |Y[3] - Y| + ... + |Y[n] - Y| = Y_cem
//
//    X_cem + Y_cem

    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());
    sort(y.begin(), y.end());
    cout << x[n / 2] << " " << y[n / 2];

}

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