Submission #73887751

---

Source Code Expand

#include<bits/stdc++.h>
// #include<atcoder/all>
using namespace std;
using ll = long long;
#define rep(i, n) for(int  i = 0; i < (n); ++i)
template<typename T> bool chmin(T& a, T b){if(a > b){a = b; return true;} return false;}
template<typename T> bool chmax(T& a, T b){if(a < b){a = b; return true;} return false;}
const long long INF = 1LL << 60;
using Graph = vector<vector<int>>;
int gcd(int a, int b){
    if(b == 0) return a;  
    else return gcd(b, a%b);
}
struct Compare {
    bool operator()(const pair<ll, int>& a, const pair<ll, int>& b) {
        return a.first > b.first;  
    }
};

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n,m; cin >> n >> m;
    vector<ll> c(m);
    rep(i,m) cin >> c[i];
    vector<int> a(n);
    vector<ll> b(n);
    rep(i,n){
        cin >> a[i] >> b[i];
        a[i]--;
    }
    ll ans = 0;
    rep(i,n){
        ans += min(c[a[i]], b[i]);
        c[a[i]] -= b[i];
        chmax(c[a[i]], 0LL);
    }
    cout << ans << endl;
}

Submission Info

Judge Result