Submission

Score: 100

User: amongus

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

Language: cpp

Time: 0.219 second

Submitted On: 2026-03-07 15:12:36

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define f first
#define s second
int a[200005] ;
pair<ll , ll > b[800005];
int main(){

    int n,m;scanf("%d %d",&n,&m);
    for(int i=1;i<=n;i++)
        scanf("%d",&a[i]);


    for(int i=1;i<=m;i++)
        scanf("%lld %lld",&b[i].f , &b[i].s);

    sort(b+1,b+m+1);
    for(int i=1;i<=m;i++){
        b[i].s =b[i].s +b[i-1].s;
        ///printf("==%lld %lld\n",b[i].f,b[i].s);
    }




    ll temp =1e15;
   for(int i=1;i<=n;i++){
        ll k = a[i];
        int idx= upper_bound(b+1,b+m+1 , make_pair(k,temp)) -b;
        printf("%lld\n",b[idx-1].s);
    }

}