Submission #1183844

#TimeUsernameProblemLanguageResultExecution timeMemory
1183844whatisdpBest Place (NOI17_bestplace)C++17
100 / 100
23 ms1096 KiB
#include<bits/stdc++.h> using namespace std; #define m1(x) template<class T, class... U> void x(T&& a, U&&... b) #define m2(x) (int[]){(x forward<U>(b),0)...} m1(pr) { cout << forward<T>(a); m2(cout << " " <<); cout << "\n"; } m1(re) { cin >> forward<T>(a); m2(cin >>); } const int INF=1e9; using pii=pair<int,int>; using ll=long long; #define mp(a,b) make_pair(a,b) int main() { cin.tie(0)->sync_with_stdio(0); int n;re(n); vector<int> va(n),vb(n); for(int i=0;i<n;i++) cin>>va[i]>>vb[i]; sort(va.begin(),va.end()); sort(vb.begin(),vb.end()); pr(va[n/2],vb[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...