Submission

Score: 0

User: faofao

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

Language: cpp

Time: 1.103 second

Submitted On: 2026-03-11 12:05:09

#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int mxN = 200005 ;
const int mxM = 800005 ;
ll power[mxN] ;
ll reward[mxN] ;
vector<pair<ll,ll>> monster ;
int n,m ;

int main(){
    int n,m ; cin >> n >> m ;
    for(int i=0 ; i<n ; i++) cin >> power[i] ;
    for(int i=0 ; i<m ; i++){
        ll p,c ; cin >> p >> c ;
        monster.push_back({p,c}) ;
    }
    sort(monster.begin(),monster.end()) ;

    for(int i=0 ; i<n ; i++){
        for(auto kv : monster){
            ll p = kv.first ;
            ll c = kv.second ;
            if(power[i] >= p){
                reward[i] += c ;
            }
            else break ;
        }
    }
    for(int i=0 ; i<n ; i++){
        cout << reward[i] << "\n" ;
    }
}