제출 #18700

#제출 시각아이디문제언어결과실행 시간메모리
18700pichulia점 모으기 (KOI13_collect)C++98
24 / 24
43 ms1864 KiB
#include<stdio.h>
#include<algorithm>
int n, m;
int x[100004],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]);
    std::sort(x,x+m);std::sort(y,y+m);
    for(i=0;i<m;i++)
        p+=std::abs(x[i]-x[m/2]) + std::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...