# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
987203 | CornerBoi | Best Place (NOI17_bestplace) | C++14 | 67 ms | 2996 KiB |
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>
using namespace std;
#define ll long long
#define all(x) x.begin(),x.end()
int main()
{
int n;cin>>n;
vector<int> a_x(n);
vector<int> a_y(n);
for(size_t i = 0;i<n;i++)
{
cin>>a_x[i]>>a_y[i];
}
sort(all(a_x));
sort(all(a_y));
ll k_x = ((ll)a_x[0]+a_x[n-1])/2;
ll k_y = ((ll)a_y[0]+a_y[n-1])/2;
cout<<k_x<<" "<<k_y<<endl;
return 0;
}
Compilation message (stderr)
# | 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... |