제출 #4123

#제출 시각아이디문제언어결과실행 시간메모리
4123pichulia점 모으기 (KOI13_collect)C++98
24 / 24
36 ms1868 KiB
#include<stdio.h>
#include<algorithm>
using namespace std;
int n, m;
int x[100004];
int y[100005];
int p;
int main()
{
	int i, j;
	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);
	for(i=0;i<m;i++)
	{
		p+=abs(x[i]-x[m/2]) + abs(y[i]-y[m/2]);
	}
	printf("%d",p);
}
#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...