Submission

Score: 0

User: Kx

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

Language: cpp

Time: 0.002 second

Submitted On: 2026-03-18 13:15:22

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

typedef vector<int> vi;
typedef vector<pair<int, int>> vpii;

int main() {
    int n, m; cin >> n >> m;
    vi hero(n);
    vpii mon(m);

    for(int i = 0; i < n; ++i) {
        cin >> hero[i];
    }

    for(int i = 0; i < m; ++i) {
        cin >> mon[i].first >> mon[i].second;
    }

    sort(mon.begin(), mon.end());

    for(int i = 0; i < n; ++i) {
        int c = 0;
        for(int j = 0; j < m; ++j) {
            if(hero[i] >= mon[j].first) c += mon[j].second;
        }
        cout << c << '\n';
    }

    return 0;
}