This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "bits/stdc++.h"
#define all(x) x.begin(),x.end()
#define int long long
//#define OSET
using namespace std;
#ifdef OSET
#include "C:\MinGW\lib\gcc\mingw32\6.3.0\include\c++\ext\pb_ds\assoc_container.hpp"
#include "C:\MinGW\lib\gcc\mingw32\6.3.0\include\c++\ext\pb_ds\tree_policy.hpp"
using namespace __gnu_pbds;
template<typename T>
using oset = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
#endif
signed main(){
ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
int n; cin >> n;
int y[n],x[n]; for(int i=0; i<n; ++i) cin >> x[i] >> y[i];
sort(x,x+n); sort(y,y+n);
cout << x[(int)floor((double)n/2)] << ' ' << y[(int)floor((double)n/2)] << '\n';
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |