Submission #69304

#TimeUsernameProblemLanguageResultExecution timeMemory
69304FedericoSFireworks (APIO16_fireworks)C++14
7 / 100
3 ms760 KiB
#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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...