Submission

Status:

[PP-SSSSSSSSSSSSSSSSS]

Subtask/Task Score:

{0/100}

Score: 0

User: chs_14

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

Language: cpp

Time: 0.002 second

Submitted On: 2026-03-05 11:34:56

#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());
    /*for (int i = 1; i < m; i++)
    {
        monsters[i].second+=monsters[i-1].second;
    }*/

    for (auto x : heroes)
    {
        int points = 0;

        for (int i = 0; i < m; i++)
        {
            if (monsters[i].first<=x) {
                points+=monsters[i].second;
            }
            else {
                break;
            }
        }
        cout << points << '\n';
    }



    return 0;
}