提出 #75875502

---

ソースコード 拡げる

#include <iostream>
#include <vector>
#include <queue>
using namespace std;
using ll = long long;
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int T;
    cin >> T;
    while (T--) {
        int N;
        cin >> N;
        vector<ll> A(N), B(N), C(N);
        for (int i = 0; i < N; ++i) {
            cin >> A[i] >> B[i] >> C[i];
        }
        priority_queue<ll> pq;
        ll cur = 0, sum = 0;
        for (int i = 0; i < N; ++i) {
            sum += A[i];
            pq.push(C[i]);
            while (cur + 1 <= 1e18 && sum >= (cur + 1) * B[i]) {
                ++cur;
                sum -= B[i];
            }
            while (sum < cur * B[i] && !pq.empty()) {
                ll c = pq.top();
                pq.pop();
                sum += c;
                --cur;
            }
            if (sum < cur * B[i]) break;
        }
        cout << cur + (sum >= cur * B.back() ? 0 : 0);
    }
    return 0;
}

提出情報

ジャッジ結果