# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1006000 | andecaandeci | Best Place (NOI17_bestplace) | C++17 | 29 ms | 2040 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>
typedef long double ld;
#define int long long
#define TC int t; cin >> t; for(int _=1; _<=t; _++)
#define pii pair<int, int>
#define pb push_back
#define mp make_pair
#define ffl fflush(stdout)
using namespace std;
int n;
vector<int> xx, yy;
int check(int x, int y){
int ret = 0;
for(int i=0; i<n; i++){
ret+=(abs(x-xx[i])+abs(y-yy[i]));
}return ret;
}
signed main(){
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin >> n;
xx.assign(n, 0); yy.assign(n, 0);
for(int i=0; i<n; i++){
cin >> xx[i] >> yy[i];
}
sort(xx.begin(), xx.end());
sort(yy.begin(), yy.end());
# | 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... |