Submission

[PPPP-SSSSSSSSSSSSSSS]

Score: 0

User: MiyaZaki1072

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

Language: cpp

Time: 0.215 second

Submitted On: 2025-04-15 19:26:44

#include <bits/stdc++.h>
using namespace std;
#define int long long
using pii =pair<int,int>;
#define f first
#define s second
pii mon[800800];
int a[200200];
signed main(){
    cin.tie(0)->sync_with_stdio(0);
    int n,m;cin>>n>>m;
    for(int i=1;i<=n;i++)cin>>a[i];
    for(int i=1;i<=m;i++){
        int x,y;cin>>x>>y;
        mon[i] = {x,y};
    }
    sort(mon+1,mon+m+1);
    for(int i=1;i<=m;i++)mon[i].s +=mon[i-1].s;
    for(int i=1;i<=n;i++){
        int idx = upper_bound(mon+1,mon+m+1,pii(a[i],1e9))-mon-1;
        cout<<mon[idx].s<<"\n";
    }
}