Submission #1027778

#TimeUsernameProblemLanguageResultExecution timeMemory
1027778MuhammetFireworks (APIO16_fireworks)C++17
7 / 100
1 ms600 KiB
#include <bits/stdc++.h>
using namespace std;

#define ll long long int
#define sz(x) (int)x.size()
#define ff first
#define ss second

const ll N = 3005;
const ll M = 1e9 + 7;

ll T, n, m, a[N], b[N];

int main(){
	ios::sync_with_stdio(false); cin.tie(0);

	cin >> n >> m;
	for(int i = 1; i <= m; i++){
		cin >> a[i] >> b[i];
	}
	sort(b+1,b+m+1);

	ll ans = 0;
	for(int i = 1; i <= m; i++){
		ans += (abs(b[i]-b[(m+1)/2]));
	}

	cout << ans;

	return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...