Submission

Score: 0

User: kimza

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

Language: cpp

Time: 0.002 second

Submitted On: 2026-03-10 10:02:12

#include <bits/stdc++.h>
#define int long long
const int N = 2e8;
using namespace std;
int32_t main(){
    cin.tie(nullptr)->sync_with_stdio(false);
    int n,m;
    cin >> n >> m;
    vector<int> v;
    int max = 0;
    for(int i=0;i<n;i++){
        int a;
        cin >> a;
        if(a > max) max = a; 
        v.push_back(a);
    }
    vector<pair<int,int>> inp;
    for(int i=0;i<m;i++){
        int c,b;
        cin >> c >> b;
        if(b > max) max = b; 
        if(c > max) max = c; 
        inp.push_back({c,b});
        
    }
    vector<int> counting(max+2,0);
    vector<int> sum(max+2,0);
    for(int i=0;i<m;i++){
        counting[inp[i].first] += inp[i].second;
    }
    
    for(int i=1;i<=max+1;i++){
        sum[i] += sum[i-1] + counting[i];
    }
    // for(auto&x: counting){
    //     cerr << x << " ";
    // }
    // cerr << "\n";
    // for(auto&x: sum){
    //     cerr << x << " ";
    // }
    for(auto&x: v){
        cout << sum[x] << "\n";
    }
    return 0;
}