Submission

Score: 100

User: kavin8888

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

Language: cpp

Time: 0.493 second

Submitted On: 2025-10-16 22:12:23

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define fs first
#define sc second
#define pll pair<long long int,long long int>
int main()
{
	int n,q; cin>>n>>q;
	vector<ll> hp(n);
	for(int i=0;i<n;i++)
	{
		cin>>hp[i];
	}
	vector<pll> boss(q);
	for(int i=0;i<q;i++)
	{
		cin>>boss[i].fs;
		cin>>boss[i].sc;
	}
	sort(boss.begin(),boss.end());
	for(int i=1;i<q;i++)
	{
		boss[i].sc+=boss[i-1].sc;
	}
	for(int i=0;i<n;i++)
	{
		auto it=upper_bound(boss.begin(),boss.end(),make_pair(hp[i]+1,(ll) 0));
		if(it==boss.begin())
		{
			cout<<"0\n";
			continue;
		}
		it--;
		cout<<(*it).second<<'\n';
	}
}