This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#include<algorithm>
#include<vector>
using namespace std;
int main(){
	int N,M,i,j;
	long long a[100000],b[100000],x = 1000000000,y = 0,ans = 0,ansl = 1000000000;
	cin >> N >> M;
	for(i = 1;i <= N + M - 1;i++){
		cin >> a[i] >> b[i];
		x = min(x,b[i]);
		y = max(y,b[i]);
	}
	for(i = x;i <= y;i++){
		ans = 0;
		for(j = 1;j <= N + M - 1;j++){
			ans += abs(i - b[j]);
		}
		ansl = min(ansl,ans);
	}
	cout << ans;
	return 0;
}
| # | 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... |