Submission #73888579

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
const ll mod = 998244353;

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

int main() {
    int n, m;
    cin >> n >> m;

    vector<int> c(m);
    for (int i=0; i<m; i++) cin >> c[i];
    
    vector<int> a(n), b(n);
    for (int i=0; i<n; i++) {
      cin >> a[i] >> b[i];
      a[i]--;
    }
    
    int ans = 0;
    for (int i=0; i<n; i++) {
      if (b[i]<=c[a[i]]) {
        c[a[i]] -= b[i];
        ans += b[i];
      } else {
        ans += c[a[i]];
        c[a[i]] = 0;
      }
    }
    cout << ans << endl;

    return 0;
}

Submission Info

Judge Result