Untitled
unknown
plain_text
4 years ago
1.2 kB
8
Indexable
#include<bits/stdc++.h> using namespace std; typedef struct point { int x; int y; } point; int main() { int n; cin >> n; point listPoint[n]; for(int i = 0; i < n; i++) { int a, b; cin >> a >> b; listPoint[i].x = a; listPoint[i].y = b; } point ans; double minD = 9999999999; for (int i = 0; i < n; i++) { double s = 0; for (int j =0; j < n; j++){ if (i == j) continue; s += abs(listPoint[i].x- listPoint[j].x) + abs(listPoint[i].y- listPoint[j].y); } double avg = s/double(n-1); if (avg < minD) { minD = avg; ans.x = listPoint[i].x; ans.y = listPoint[i].y; } else if (avg == minD) { if (ans.x > listPoint[i].x){ ans.x = listPoint[i].x; ans.y = listPoint[i].y; } else if (ans.x == listPoint[i].x) { if (ans.y > listPoint[i].y) { ans.x = listPoint[i].x; ans.y = listPoint[i].y; } } } } cout << ans.x << " " << ans.y; return 0; }
Editor is loading...