Submission

Score: 0

User: House123

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

Language: cpp

Time: 1.075 second

Submitted On: 2026-03-12 00:56:13

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


int main(){
    int n,m;
    cin >> n >> m;
    vector<int> hero(n);
    map<int,long long> monster;
    for(int i = 0; i < n ; i++) {
         cin >> hero[i];
    }    

    for(int i = 0; i < m ; i++ ){
        int power,coin;
        cin >> power >> coin;
        monster[power] += coin;
    }
    long long prefix_sum= 0;
    for(auto& pair:monster){
        prefix_sum += pair.second;
        pair.second = prefix_sum;
    }

    for(int i = 0; i < n;i++){
        auto it = monster.upper_bound(hero[i]);

        if(it == monster.begin()){
            cout << 0 << endl;
            
        } else {
            it--;
            cout << it->second << endl;
            
        }

    }
}