All Manhattan Distances

CSESGeometryOpen on judge ↗

Given a set of points, calculate the sum of all Manhattan distances between two point pairs. Input The first line has an integer n: the number of points. The following n lines describe the points. Each line has two integers x and y. You can assume that each point is distinct. Output Print the sum of all Manhattan distances. Constraints - 1 \le n \le 2 \cdot 10^5 - -10^9 \le x, y \le 10^9

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI