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<iostream>
#include<cmath>
#include<bits/stdc++.h>
#include<string.h>
using namespace std;
typedef long long int ll;
const ll maxn=1e5+2;
int main()
{
ll n;
cin>>n;
ll a[n][2],i;
ll mx=0,my=0,mix=1e10,miy=1e10;
for(i=0;i<n;i++)
{
cin>>a[i][0]>>a[i][1];
if(a[i][0]>=mx)
mx=a[i][0];
if(a[i][0]<=mix)
mix=a[i][0];
if(a[i][1]>=my)
my=a[i][1];
if(a[i][1]<=miy)
miy=a[i][1];
}
ll x=(mx+mix)/2;
ll y=(my+miy)/2;
cout<<x<<" "<<y<<"\n";
cerr<<"\nTime elapsed:"<< 1000 * clock() / CLOCKS_PER_SEC << "ms\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... |