Submission

[PPPPPPPPPPPPPPPPPPPP]

Score: 100

User: Nagornz

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

Language: cpp

Time: 0.310 second

Submitted On: 2025-03-25 18:03:06

#include <bits/stdc++.h>
#define int long long
#define double long double
#define pii pair <int,int>
#define tiii tuple <int, int, int>
#define f first
#define s second
#define all(x) x.begin(), x.end()
#define ub(a, b) upper_bound(a.begin(), a.end(), b) - a.begin()
#define lb(a, b) lower_bound(a.begin(), a.end(), b) - a.begin()
#define ve vector
#define graph(a, n) vector <int> a[n];
#define wgraph(a, n) vector <pii> a[n];
#define emb emplace_back
#define em emplace
#define ins insert
#define er erase
#define iShowSpeed cin.tie(NULL)->sync_with_stdio(false)

using namespace std;

template <typename T>
using greater_priority_queue = priority_queue<T, vector<T>, greater<T>>;

const int mod = 1e9 + 7;
const int inf = 1e18;

int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};

int32_t main(){
    iShowSpeed;
    int n, m; cin >> n >> m;
    vector <int> a(n), ans(n);
    for (auto &e : a) cin >> e;
    vector <pii> mon(m);
    for (int i = 0; i < m; i++) cin >> mon[i].f >> mon[i].s;
    sort(all(mon));
    vector <int> power(m);
    for (int i = 0; i < m; i++) power[i] = mon[i].f;
    vector <int> pref(m);
    pref[0] = mon[0].s;
    for (int i = 1; i < m; i++) {
        pref[i] = pref[i - 1] + mon[i].s;
    }
    for (int i = 0; i < n; i++) {
        int idx = ub(power, a[i]) - 1;
        // cout << i << ": " << idx << "\n";
        if (idx < 0) continue;
        ans[i] = pref[idx];
    }
    for (auto e : ans) cout << e << "\n";
}