Submission

Status:

[PPP-SSSSSSSSSSSSSSSS]

Subtask/Task Score:

{0/100}

Score: 0

User: meme_boi2

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

Language: cpp

Time: 0.003 second

Submitted On: 2026-03-18 16:43:27

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pii array<int,2>
bool comp(pii a, pii b){
    return a[0] < b[0];
}
int32_t main(){
    cin.tie(nullptr)->sync_with_stdio(0);
    int q, n;
    cin >> q >> n;
    vector<int> vec(q);
    for(auto &x : vec) cin >> x;
    vector<pii> mat(n);
    for(auto &x: mat){
        cin >> x[0] >> x[1];
    }

    vector<int> idx;
    sort(mat.begin(),mat.end());
    vector<int> dp(n+1,0);
    for(int i =0; i < n; i++){
        dp[i+1] = dp[i] + mat[i][1];
        idx.push_back(mat[i][0]);
    }
    dp[0] = dp[1];
    for(auto x: vec){
        auto it = upper_bound(idx.begin(),idx.end(),x) - idx.begin();
        cout << dp[it] << '\n';
    }
}
/*
c2_st66_heroes

cd "c:\Users\RICOH-NB110\Desktop\Computer Programing\gchan\" ; if ($?) { g++ c2_st66_heroes.cpp -o c2_st66_heroes } ; if ($?) { .\c2_st66_heroes} 
*/