Submission

Score: 100

User: vachirasawin

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

Language: cpp

Time: 0.216 second

Submitted On: 2026-03-13 17:36:17

// grader-chan
// c2_st66_heroes.cpp | c2_st66_heroes

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

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);

    int N, M;
    cin >> N >> M;

    vector<int> heroes(N);
    for (int i = 0; i < N; i++) cin >> heroes[i];

    vector<pair<int, int>> monsters(M);
    for (int i = 0; i < M; i++) cin >> monsters[i].first >> monsters[i].second;
    sort(monsters.begin(), monsters.end());

    vector<long long> prefix_coins(M + 1, 0);
    for (int i = 0; i < M; i++) prefix_coins[i + 1] = prefix_coins[i] + monsters[i].second;
    vector<int> monster_powers(M);
    for(int i = 0; i < M; i++) monster_powers[i] = monsters[i].first;

    for (int i = 0; i < N; i++) {
        auto it = upper_bound(monster_powers.begin(), monster_powers.end(), heroes[i]);
        int idx = distance(monster_powers.begin(), it);

        cout << prefix_coins[idx] << "\n";
    }

    return 0;
}