제출 #1320032

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1320032		hyyh	Best Place (NOI17_bestplace)	C++20	100 / 100	76 ms	1296 KiB

bestplace

#include <iostream>
#include <math.h>
#include <vector>
#include <string>
#include <algorithm>
#include <queue>
#include <stack>
#include <map>
#include <cstring>
#include <iomanip>
#include <stdio.h>
#include <unordered_map>
#include <bitset>
#include <tuple>
using namespace std;
using ll = long long;
using pii = pair<int,int>;
using piii = tuple<int,int,int>;
#define endl '\n'
#define f first
#define s second

int main(){
    int n;cin >> n;
    vector<int> x;
    vector<int> y;
    for(int i{};i < n;i++){
        int a,b;cin >> a >> b;
        x.emplace_back(a);
        y.emplace_back(b);
    }
    sort(x.begin(),x.end());
    sort(y.begin(),y.end());
    if(n & 1){
        cout << x[n/2] << " " << y[n/2];
    }
    else{
        cout << (x[(n-1)/2]+x[(n)/2])/2 << " " << (y[(n-1)/2]+y[(n)/2])/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