Submission

Score: 0

User: sulinx

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

Language: cpp

Time: 0.002 second

Submitted On: 2026-03-09 13:00:04

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

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    
    int n,m;
    cin >> n >> m;
    
    vector<ll> hero(n);
    for(int i = 0;i<n;i++){
        cin >> hero[i];
    }

    vector<pair<ll,ll>> monster(m);
    for(int i = 0;i<m;i++){
        cin >> monster[i].first >> monster[i].second;
    }sort(monster.begin(),monster.end());

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