Submission #73904477

---

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

// M = 1,2,..
// Grams(j) = 1<= j <= M.size
// orders N dishes
// if dish i, A(i) pepper = true, else false
// Max amount = B. : A < B
// Total Pepper (j) < C(j) grams
// Goal: total pepper sprinkle possible


int main() {
    int n, m;
    if (!(cin >> n >> m)) return 0;

    vector<long long> c(m + 1);
    for (int j = 1; j <= m; j++) {
        cin >> c[j];
    }

    // sum b_i for each pepper type a_i
    vector<long long> demand(m + 1, 0);
    for (int i = 0; i < n; i++) {
        int a;
        long long b;
        cin >> a >> b;
        // Group dish i's limit into its required pepper type a_i
        demand[a] += b;
    }

    long long total_sprinkled = 0;
    for (int j = 1; j <= m; j++) {
        //can only use as much as have (C) or as much as is allowed (demand)
        total_sprinkled += min(c[j], demand[j]);
    }

    cout << total_sprinkled << endl;

    return 0;
}

Submission Info

Judge Result