Submission #5597922

---

Source Code Expand

#pragma GCC optimize ("O3")
#pragma GCC target ("tune=native")
#pragma GCC target ("avx")

#include <bits/stdc++.h>

// 汎用マクロ
#define ALL_OF(x) (x).begin(), (x).end()
#define REP(i,n) for (long long i=0, i##_len=(n); i<i##_len; i++)
#define RANGE(i,is,ie) for (long long i=(is), i##_end=(ie); i<=i##_end; i++)
#define DSRNG(i,is,ie) for (long long i=(is), i##_end=(ie); i>=i##_end; i--)
#define UNIQUE(v) { sort((v).begin(), (v).end()); (v).erase(unique((v).begin(), (v).end()), (v).end()); }
template<class T> bool chmax(T &a, const T &b) {if (a < b) {a = b; return 1;} return 0; }
template<class T> bool chmin(T &a, const T &b) {if (a > b) {a = b; return 1;} return 0; }
#define INF 0x7FFFFFFF
#define LINF 0x7FFFFFFFFFFFFFFFLL
#define Yes(q) (q ? "Yes" : "No")
#define YES(q) (q ? "YES" : "NO")
#define DUMP(q) cerr << "[DEBUG] " #q ": " << (q) << " at " __FILE__ ":" << __LINE__ << endl
#define DUMPALL(q) { cerr << "[DEBUG] " #q ": ["; REP(dumpall_i, (q).size()) { cerr << q[dumpall_i] << (dumpall_i == (q).size() - 1 ? "" : ", "); } cerr << "] at " __FILE__ ":" << __LINE__ << endl; }

// gcc拡張マクロ
#define gcd __gcd
#define popcount __builtin_popcount
#define popcountll __builtin_popcountll

// エイリアス
using  ll = long long;
using ull = unsigned long long;
using  ld = long double;
using namespace std;

// モジュール


// 処理内容
int main() {
    
    ll n, m; cin >> n >> m;
    vector<ll> a(n);
    REP(i, n) cin >> a[i];
    vector<pair<ll,ll>> bc(m);
    REP(i, m) cin >> bc[i].first >> bc[i].second;

    sort(ALL_OF(a));
    sort(ALL_OF(bc), [](auto &bci, auto &bcj) -> bool {
        if (bci.second != bcj.second)
            return bci.second > bcj.second;
        else
            return bci.first > bcj.first;
    });

    ll unchanged = 0;
    REP(i, m) {
        ll lb = lower_bound(a.begin() + unchanged, a.end(), bc[i].second) - a.begin();
        ll en = unchanged + min(bc[i].first, lb - unchanged);
        RANGE(j, unchanged, en-1) {
            a[j] = bc[i].second;
        }
        unchanged = en;
    }

    cout << accumulate(ALL_OF(a), 0LL) << endl;
    
}

Submission Info

Judge Result