Submission #956264

#	Time	Username	Problem	Language	Result	Execution time	Memory
956264		Github	Best Place (NOI17_bestplace)	C++17	3 / 100	30 ms	3164 KiB

bestplace

#include <iostream>
#include <cstring>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
using namespace std;

#define speedup ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
const long long mod = 1e9+7;
#define ll long long


int main() {
    speedup
    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());
    if (n%2 == 1){
        cout << x[(n+1)/2] << ' ' << y[(n+1)/2] << endl;
    }else{
        cout << (x[n/2-1]+x[n/2])/2 << ' ' << (y[n/2-1]+y[n/2])/2 << endl;
    }
    return 0;
}

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