제출 #1331563

#제출 시각아이디문제언어결과실행 시간메모리
1331563michael12Best Place (NOI17_bestplace)C++20
100 / 100
26 ms1860 KiB
#include<bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define int long long
#define endl '\n'
using namespace std;
const int maxn = 5e5 + 5;
const int oo = 1e18;
const int inf = 1e18;
signed main(){
   ios::sync_with_stdio(false);
   cin.tie(nullptr);
   int n, m;
   cin >> n;
   vector<int> a(n), b(n);
   for(int i = 0; i < n; i++){
       cin >> a[i] >> b[i];
   }
   sort(a.begin(), a.end());
   sort(b.begin(), b.end());
   cout << a[n / 2] << " " << b[n / 2];


   

    
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...