int n, k;
	cin >> n >> k;
	vi t(n), b(n);
	vector<pair<int, int>> a(n);
	vector<pair<int, int>> a2(n);
	fi(i, 0, n)
	{
		cin >> t[i] >> b[i];
		a[i].first = t[i];
		a[i].second = b[i];
		a2[i].first = b[i];
		a2[i].second = t[i];

	}
	sort(a.begin(), a.end());
	sort(a2.begin(), a2.end());
	vector<pair<int, int>> dp(n);
	int m = b[0];
	int sum = 0;
	fi(i, 0, n)
	{
		sum += t[i];
		m = min(m, b[i]);
	}
	dp[n - 1] = { sum,m };