Submission #867322

#	Time	Username	Problem	Language	Result	Execution time	Memory
867322		psm9352	Best Place (NOI17_bestplace)	C++17	100 / 100	79 ms	3100 KiB

bestplace

#include <iostream>
#include <algorithm>

int main(){
    int n;std::cin >> n;
    int arrx[n];int arry[n];
    for (int i = 0;i < n;i++){std::cin >> arrx[i];std::cin >> arry[i];}
    std::sort(arrx,arrx+n);std::sort(arry,arry+n);
    if (n % 2==0){
        std::cout << (arrx[n/2-1]+arrx[n/2])/2 << " " << (arry[n/2-1]+arry[n/2])/2;
    }else{
        std::cout << arrx[(n-1)/2] << " " << arry[(n-1)/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