提出 #73405996

---

ソースコード 拡げる

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

using ll = long long;
using ld = long double;
#define OVERLOAD_REP(_1, _2, _3, name, ...) name
#define REP1(i, n) for(int i = 0; i < (int)(n); i++)
#define REP2(i, a, b) for(int i = (int)(a); i < (int)(b); i++)
#define rep(...) OVERLOAD_REP(__VA_ARGS__, REP2, REP1)(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const int ddx[8] = {1, 1, 0, -1, -1, -1, 0, 1};
const int ddy[8] = {0, 1, 1, 1, 0, -1, -1, -1};

template <typename T> istream &operator>>(istream &is, vector<T> &v) {
    for (T &in : v) is >> in;
    return is;
}

template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
    for (int i = 0; i < (int)v.size(); i++) {
        os << v[i] << (i + 1 != (int)v.size() ? " " : "");
    }
    return os;
}

template <typename T> ostream &operator<<(ostream &os, const vector<vector<T>> &v) {
    for (int i = 0; i < (int)v.size(); i++) {
        os << v[i] << (i + 1 != (int)v.size() ? "\n" : "");
    }
    return os;
}

// #include <atcoder/all>
// using namespace atcoder;
// using mint = modint998244353;
// using mint = modint1000000007;

int main() {
    // ios::sync_with_stdio(false);
    // cin.tie(nullptr);
    // cout << fixed << setprecision(15);

    int N, M; cin >> N >> M;
    vector<int> F(N), D(N);

    rep (i, N) {
        cin >> F[i] >> D[i];
    }

    ll ans = 0;
    priority_queue<pair<int, int>> Q;
    rep (i, N) {
        Q.push({F[i], i});
    }

    rep (t, M) {
        auto [val, idx] = Q.top(); Q.pop();
        ans += val;
        Q.push({max(0, val - D[idx]), idx});
    }

    cout << ans << "\n";

    return 0;
}

提出情報

ジャッジ結果