# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
972459 | melody_rules | Best Place (NOI17_bestplace) | C++17 | 0 ms | 0 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>
#define int long long
using namespace std;
signed main() {
int n=0;
int a=0;
double b=0;
double c=0;
int i=0;
double d;
double f;
cin>>n;
for(i=0;i<n;i++) {
cin>>a;
b += a;
cin>>a;
c += a;
}
b/=n;
c/=n;
e = b - floor(b);
f = ceil(b) - b;
if(e < f)
b = floor(b);
else
b = ceil(b);
e = c - floor(c);
f = ceil(c) - c;
if(e < f)
c = floor(c);
else
c = ceil(c);
cout<<b<<" "<<c<<endl;
return 0;
}