백준 - 14400 편의점 2

long long 생각하자 맨해튼거리

 

#include <iostream>
#include <vector>
#include <algorithm>
#include <string>

using namespace std;

int main(void)
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);	cout.tie(0);

	int num;
	cin >> num;

	vector<int> vecx(num);
	vector<int> vecy(num);

	for (int i = 0; i < num; ++i)
	{
		cin >> vecx[i] >> vecy[i];
	}

	sort(vecx.begin(), vecx.end());
	sort(vecy.begin(), vecy.end());

	int minx = vecx[(num) / 2];
	int miny = vecy[(num) / 2];

	long long ans = 0;
	for (int i = 0; i < num; ++i)
	{
		ans += abs(vecx[i] - minx);
		ans += abs(vecy[i] - miny);
	}

	cout << ans;

	return 0;
}