提出 #19383871

---

ソースコード 拡げる

#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using vi = vector<int>;
using vll = vector<long long>;
using pll = pair<long long, long long>;

int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};

constexpr long long mod = 1000000007;

#define rep(i, n) for (int i = 0; i < n; i++)

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

    ll n, c;
    cin >> n >> c;

    vector<pll> v;
    rep(i, n) {
        ll a, b, d;
        cin >> a >> b >> d;

        v.push_back(make_pair(a - 1, d));
        v.push_back(make_pair(b, -d));
    }

    sort(v.begin(), v.end());

    ll sum = 0;
    ll fee = 0;
    ll t = 0;
    for (auto p : v) {
        if(p.first!=t){
            sum += min(fee, c) * (p.first - t);
            t = p.first;
        }
        fee += p.second;
    }

    cout << sum << endl;
}

提出情報

ジャッジ結果