提出 #73906212

---

ソースコード 拡げる

/*Sin_qwq's code
We can be heros , just for one day .*/
#include <bits/stdc++.h>
#define LD long double
#define i7 __int128
#define re return
#define con continue
#define ci const int
#define all(x) x.begin(), x.end()
#define All(x) x.begin() + 1, x.end()
using namespace std;
typedef long long i64;
template <class T>
inline bool ckmin(T &a, T b) { re b < a ? a = b, 1 : 0; }
template <class T>
inline bool ckmax(T &a, T b) { re a < b ? a = b, 1 : 0; }

void work()
{
    int n, m;
    cin >> n >> m;
    vector<int> C(m + 1);
    for (int i = 1; i <= m; i++)
    {
        cin >> C[i];
    }
    int sum = 0;
    vector<int> A(n + 1), B(n + 1);
    for (int i = 1; i <= n; i++)
    {
        cin >> A[i] >> B[i];
        if (C[A[i]] >= B[i])
        {
            C[A[i]] -= B[i];
            sum += B[i];
            B[i] = 0;
        }
        else
        {
            sum += C[A[i]];
            B[i] -= C[A[i]];
            C[A[i]] = 0;
        }
    }
    cout << sum << "\n";
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int T = 1;
    // cin>>T;
    while (T--)
    {
        work();
    }
    re 0;
}
/*
 */

提出情報

ジャッジ結果