Submission #6407615

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

const int N = 200 * 1000 + 17;
const int MOD = 1000 * 1000 * 1000 + 7;

int n;
long long a[N], b[N];

bool read() {
    if (!(cin >> n))
        return false;

    for (int i = 0; i < n; ++i)
        cin >> a[i] >> b[i];

    return true;
}

void solve() {
    auto sum = accumulate(a, a + n, 0ll);
    auto mn = sum;

    for (auto i = 0; i < n; ++i)
        if (a[i] > b[i])
            mn = min(mn, b[i]);

    cout << sum - mn << endl;
}

int32_t main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    while (read())
        solve();

    return 0;
}

Submission Info

Judge Result