Submission

Score: 0

User: Quaoar

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

Language: cpp

Time: 0.560 second

Submitted On: 2026-01-01 20:59:06

#include <iostream>
using namespace std;

typedef long long ll;
ll power[200001];
ll PC[800001][2];
ll coin[10000000] = {};

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++){
        cin >> PC[i][0] >> PC[i][1];
    }
    
    for (int i = 0 ; i < n ; i++){
        if (coin[power[i]] != 0){
            cout << coin[power[i]] << "\n";
            continue;
        }
        for (int j = 0 ; j < m ; j++){

            if (power[i] >= PC[j][0]){
                coin[power[i]] += PC[j][1];
            }
        }
        cout << coin[power[i]] << "\n";
    }
    return 0;
}