全红求条(玄关！！！)

#include <bits/stdc++.h>
using namespace std;
map<int,int> c;
int main() {
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	int n,k;
	cin >> n >> k;
	for (int i=1;i<=n;++i) {
		int x,y;
		cin >> x >> y;
		c[x] = y;
	}
	int ans = INT_MAX;
	for (auto i : c) {
		int x = i.first,y = i.second;
		c.erase(i.first);
		int cnt = 0,last = 0;
		for (auto j : c) {
			if (last) {
				cnt += abs(j.second - last);
			}
			last = j.second;
		}
		ans = min(ans,cnt);
		c[x] = y;
	}
	cout << ans << '\n';
	return 0;
}