士兵 POJ1723

士兵 POJ1723

思路

题干在这:POJ1723
y坐标是一个很标准的中位数做法,x坐标把表达式写写发现调整一下x坐标值也是一个中位数做法

ac代码

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
using namespace std;
int x[10010] = { 0 };
int y[10010] = { 0 };
int main() {
	int n;
	cin >> n;
	long long sumx = 0, sumy = 0;
	for (int i = 1; i <= n; i++) {
		cin >> x[i] >> y[i];
	}
	sort(y + 1, y + n + 1);
	sort(x + 1, x + n + 1);
	for (int i = 1; i <= n; i++) {
		x[i] -= i;
	}
	sort(x + 1, x + n + 1);
	long long result = 0;
	for (int i = 1; i <= n; i++) {
		result += (long long)abs(x[i] - x[n / 2 + 1]) + (long long)abs(y[i] - y[n / 2 + 1]);
	}
	cout << result;
}
发布了24 篇原创文章 · 获赞 0 · 访问量 353

猜你喜欢

转载自blog.csdn.net/qq_45616764/article/details/104203451
今日推荐