Submission #1168361

---

Source Code Expand

//部分点
#include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cassert>
#define int long long
using namespace std;

const int MAX = 400;
int n;
int l[400], r[400];

signed main() {
	int i, j;
	
	cin >> n;
	for (i = 0; i < n; i++) cin >> l[i] >> r[i];
	
	int ans = MAX * MAX;
	
	for (i = 0; i <= MAX; i++) {
		int cst = 0;
		
		for (j = 0; j < n; j++) {
			if (i < l[j]) {
				cst += l[j] - i;
			}
			else if (i <= r[j]) {
				cst += 0;
			}
			else {
				cst += i - r[j];
			}
		}
		ans = min(ans, cst);
	}
	
	cout << ans << endl;
	return 0;
}

Submission Info

Judge Result