Submission #2572638

---

Source Code Expand

#include <iostream>

using namespace std;
typedef long long ll;
const int MAX_N = 100010;
ll h[MAX_N], s[MAX_N];
bool used[MAX_N];
int main() {
    int n;
    cin >> n;
    for (int i=0;i<n;i++) {
        cin >> h[i] >> s[i];
    }
    ll tmp = 0;
    for (int i=0;i<n;i++) {
        int index = -1;
        for (int j=0;j<n;j++) {
            if (!used[j] && (index != -1 || h[index] + s[index] * (i+1) < h[j] + s[j] * (i+1)) || (h[index] + s[index] * (i+1) == h[j] + s[j] *(i+1) && s[j] > s[index])) {
                index = j;
            }
        }
        tmp = max(tmp, h[index] + s[index] * i);
        used[index] = true;
    }
    cout << tmp << endl;
}

Submission Info

Judge Result