Submission

[-SSSSSSSSSSSSSSSSSSS]

Score: 0

User: muekwakungaroo

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

Language: cpp

Time: 0.002 second

Submitted On: 2025-03-31 10:05:37

#include<bits/stdc++.h>
using namespace std;
using ll=long long int;
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int n,m;
    cin>>n>>m;
    int ar[n];
    for(int i=0;i<n;i++){
        cin>>ar[i];
    }
	int maxi=0;
    pair<int,int> ans[m];
	int f[m];
    for(int i=0;i<m;i++){
        cin>>ans[i].first>>ans[i].second;
		maxi=max(maxi,ans[i].first);
		f[i]=ans[i].first;
	}
    sort(ans,ans+m);
	ll pre[m];
    int idx[m];
	int i=0;
	pre[0]=ans[0].second;
	idx[0]=ans[0].first;
	for(int i=1;i<m;i++){
		pre[i]=pre[i-1]+ans[i].second;
		idx[i]=ans[i].first;
	}
	for(int i=0;i<m;i++){
		cout<<pre[i]<<' ';
	}
	cout<<'\n';
	for(int i=0;i<n;i++){
		cout<<pre[(upper_bound(idx,idx+m,ar[i])-idx)-1]<<'\n';
	}

    return 0;
}
/*
4 5
1 4 2 6
1 2
1 3
5 4
2 5
3 6

*/