Submission

Score: 0

User: theem1502

Problemset: ฮีโร่และมอนสเตอร์

Language: cpp

Time: 0.002 second

Submitted On: 2026-02-21 00:03:51

#include <bits/stdc++.h>
using namespace std;

int main() {
    int n, m;
    cin >> n >> m;
    vector<int> hero(n);
    vector<pair<int,int>> thearray(m);
    for (int i = 0; i < n; i++) {
        cin >> hero[i];
    }
    for (int  i = 0; i < m; i++) {
        cin >> thearray[i].first >> thearray[i].second;
    }
    sort(thearray.begin(),thearray.end());
    vector<int> prefixarray(m);
    vector<int> indexarray(m);
    prefixarray[0] = thearray[0].second;
    for (int i = 0; i < m; i++) {
        indexarray[i] = thearray[i].first;
        if (i == 0) {
        continue;}
        prefixarray[i] = prefixarray[i-1] + thearray[i].second;
    }

    for (int i = 0; i < n ;i++) {
        int cnt = upper_bound(indexarray.begin(), indexarray.end(), hero[i]) - indexarray.begin() - 1;
        cout << prefixarray[cnt] << "\n";
    }


}