Submission

Score: 0

User: Test

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

Language: cpp

Time: 0.003 second

Submitted On: 2026-03-04 17:45:39

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

int main(){
    int n,m;
    cin >> n >> m;
    vector<int> hero(n);
    priority_queue<pair<int, int>,
    vector<pair<int, int>>,
    greater<pair<int, int>>> pq;

    priority_queue<pair<int, int>,
    vector<pair<int, int>>,
    greater<pair<int, int>>> pq2;


    for(int i=0;i<n;i++){
        cin >> hero[i];
    }
    for(int i=0;i<m;i++){
        int x,y;
        cin >> x >> y;
        pq.push({x,y});
    }
    pq2=pq;
    for(int i=0;i<n;i++){
        int ct=0,sm=0;
        //int save = hero[i];
        while(pq.top().first<=hero[i] && !pq.empty()){
            ct+=pq.top().second;
            sm++;
            pq.pop();
        }
        pq=pq2;
    cout << ct << "\n";
    }
}
/*
4 5
1 4 2 6
1 2
1 3
5 4
2 5
3 6
*/