제출 #3150

#제출 시각아이디문제언어결과실행 시간메모리
3150movie_jo점 모으기 (KOI13_collect)C++98
24 / 24
40 ms1868 KiB
#include <stdio.h>
#include "algorithm"

using namespace std;

int x[100000], y[100000];

int main(void)
{
	int N, M, i, cx, cy, s = 0;

	scanf("%d %d", &N, &M);

	for(i = 0; i < M; i++)
		scanf("%d %d",&x[i], &y[i]);

	sort(x, x+M);
	sort(y, y+M);

	cx = x[M / 2];
	cy = y[M / 2];

	for(i = 0; i < M; i++)
	{
		s += cx > x[i] ? cx - x[i] : x[i] - cx;
		s += cy > y[i] ? cy - y[i] : y[i] - cy;
	}

	printf("%d\n", s);
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...