Submission

Score: 0

User: Quaoar

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

Language: cpp

Time: 0.004 second

Submitted On: 2026-01-01 19:49:18

#include <iostream>
using namespace std;

typedef long long ll;
ll power[200001];
ll PC[800001][2];

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