Submission

Score: 0

User: Quaoar

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

Language: cpp

Time: 0.002 second

Submitted On: 2026-02-28 15:02:57

#include <iostream>
#include <map>
#include <algorithm>
using namespace std;
using ll = long long;

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

    for (int i = 0 ; i < m ; i++){
        int a , b;
        cin >> a >> b;
        um[a] += b;
    }
    /*
    cout << "\n";

    for (auto i : um){
        cout << i.first << " " << i.second;
        cout << "\n";
    }
    */
    int cnt = 0;
    for (int i = 0 ; i < n ; i++){
        cnt = 0;
        for (auto j : um){
            if (power[i] >= j.first){
                cnt += j.second;
            } else {
                break;
            }
        }
        cout << cnt << "\n";

    }
    
    return 0;
}