| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1339542 | Minbaev | Best Place (NOI17_bestplace) | C++20 | 1094 ms | 1092 KiB |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll inf = 3e18;
void solve() {
int n;
cin >> n;
vector<int> x(n), y(n);
for(int i = 0;i<n;i++){
cin >> x[i] >> y[i];
}
int a = -1, b = -1;
ll res = inf;
for(int i = 0;i<n;i++){
ll sum = 0;
for(int j = 0;j<n;j++){
sum += (ll)abs(x[i] - x[j]) + abs(y[i] - y[j]);
}
if(res > sum){
a = x[i], b = y[i];
}
}
cout << a << " " << b << "\n";
}
/*
6
1 0
3 0
5 0
7 0
9 0
11 0
*/
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr); cout.tie(nullptr);
int tt = 1;
while (tt--) solve();
}
| # | 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... | ||||
