Submission

Score: 0

User: Aumar

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

Language: cpp

Time: 0.002 second

Submitted On: 2026-02-18 20:34:35

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

int main(){
    cin.tie(nullptr)->sync_with_stdio(false);
    int n, m; cin >> n >> m;
    int hero[n];
    for (int i=0; i<n; i++) cin >> hero[i];
    vector<pair<int, int>> monster(m);
    for (int i=0; i<m; i++){
        cin >> monster[i].first >> monster[i].second;
    }
    sort(monster.begin(), monster.end());

    vector<long long> prefix_sum(m);

    prefix_sum[0] = monster[0].second;
    for (int i=1; i<m; i++){
        prefix_sum[i] = prefix_sum[i-1] + monster[i].second;
    }

    for (int i=0; i<n; i++){
        for (int j=0; j<m; j++){
            if (hero[i] < monster[j].first){
                cout << prefix_sum[j-1] << "\n";
                break;
            } else if (i==n-1 && j==m-1) cout << prefix_sum[j];
        }
    }
}