Submission

Score: 0

User: Quaoar

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

Language: cpp

Time: 0.013 second

Submitted On: 2026-02-28 15:32:51

#include <iostream>
#include <map>
#include <algorithm>
#include <vector>
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];
    vector <ll> sum;
    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;
    }

    int cnt = 0;
    int s = 0;
    for (int i = 0 ; i < um.size() ; i++){
        s = s + um[i];
        sum.push_back(s);
    }
    
    
    //cout << "\n";
    /*
    for (auto i : um){
        cout << i.first << " " << i.second;
        cout << "\n";
    }
    for (int i = 0 ; i < sum.size() ; i++){
        cout << "sum :" << i << " "<< sum[i] << "\n";
    }
    */
    for (int i = 0 ; i < n ; i++){
        if (power[i] >= sum.size()){
            cout << sum[sum.size() - 1];
        } else {
            cout << sum[power[i]] << "\n";
        }
    }
    
    return 0;
}