Submission

Score: 100

User: chs_14

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

Language: cpp

Time: 0.215 second

Submitted On: 2026-03-05 12:42:35

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

int main() {
    cin.tie(0)->sync_with_stdio(0);

    int n, m;
    cin >> n >> m;
    vector<int> heroes(n);
    vector<pair<int, int>> monsters(m);
    for (int i = 0; i < n; i++)
    {
        cin >> heroes[i];
    }
    for (int i = 0; i < m; i++)
    {
        cin >> monsters[i].first >> monsters[i].second;
    }
    sort(monsters.begin(), monsters.end());
    vector<long long> pref(m, 0);
    pref[0] = monsters[0].second;

    for (int i = 1; i < m; i++)
    {
        pref[i] = monsters[i].second+pref[i-1];
    }

    for (auto x : heroes)
    {
        int pos = upper_bound(monsters.begin(), monsters.end(), make_pair(x, (int)2e9)) - monsters.begin();
        if (pos==0) {
            cout << 0 << '\n';
        }
        else {
            cout << pref[pos-1] << '\n';
        }
    }

    return 0;
}