Bolsas

bolsas.cpp

#include <bits/stdc++.h>

#define D first
#define T second

using namespace std;

typedef pair<int, int> pii;

const int maxn = 10010;

pii v[maxn];

int main()
{
	int n;
	cin >> n;

	for (int i = 0; i < n; i++) {

		cin >> v[i].T >> v[i].D;
	}

	sort(v, v + n);

	long long s = 0;
	long long matraso = 0;

	for (int i = 0; i < n; i++) {

		s += v[i].T;

		if (s > v[i].D) matraso = max(matraso, s - v[i].D);
	}

	cout << matraso << "\n";

	return 0;
}