제출 #494775

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
494775		AJ00	Best Place (NOI17_bestplace)	C++14	100 / 100	47 ms	3260 KiB

bestplace

#include <bits/stdc++.h>
using namespace std;
vector<int> xs,ys;
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int t=1,n,x,y; 
    //cin >> t; 
    while (t--){
        cin >> n;
      for (int i = 0; i < n; i++){
        cin >> x >> y;
        xs.push_back(x);
        ys.push_back(y);
      }
      sort(xs.begin(),xs.end());
      sort(ys.begin(),ys.end());
      if (n%2==1){
        cout << xs[(n/2)] << " " << ys[(n/2)] << "\n";
      }
      else {
        cout << (xs[n/2]+xs[(n/2)-1])/2 << " " << (ys[n/2]+ys[(n/2)-1])/2 << "\n";
      }
    }
    return 0;
}

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