This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#pragma GCC optimize("Ofast")
#include <iostream>
#include <algorithm>
using namespace std;
typedef long long int ll;
ll N;
ll V[1000006];
ll ans;
int main(){
cin>>N>>N;
for(int i=0;i<N;i++)
cin>>V[i]>>V[i];
sort(V,V+N);
for(int i=0;i<N;i++)
ans+=abs(V[i]-V[N/2]);
cout<<ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |