제출 #533481

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
533481		andecaandeci	Best Place (NOI17_bestplace)	C++17	100 / 100	38 ms	3780 KiB

bestplace

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

#define nyahalo ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define otsumiko exit(0);
#define mikodanye priority_queue<pair<long long, long long>, vector<pair<long long, long long> >, greater<pair<long long, long long> > >
#define mikochi priority_queue<long long, vector<long long>, greater<long long> >

int main() {
  nyahalo
  long long n;
  cin >> n;
  long long x[n+1], y[n+1];
  for (long long i=1; i<=n; i++) {
    cin >> x[i] >> y[i];
  }
  sort(x+1, x+n+1);
  sort(y+1, y+n+1);
  cout << x[(n+1)/2] << " " << y[(n+1)/2] << "\n";
  otsumiko
}

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