Submission #1212

#TimeUsernameProblemLanguageResultExecution timeMemory
1212gs13068점 모으기 (KOI13_collect)C++98
24 / 24
38 ms1668 KiB
#include<cstdio> #include<algorithm> #define abs(x) ((x)<0?-(x):(x)) int a[100000]; int b[100000]; int main() { int i,n,res=0; scanf("%*d%d",&n); for(i=0;i<n;i++)scanf("%d%d",&a[i],&b[i]); std::sort(a,a+n); std::sort(b,b+n); for(i=0;i<n;i++)res+=abs(a[n/2]-a[i])+abs(b[n/2]-b[i]); printf("%d",res); }
#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...