Submission

Score: 0

User: kavin8888

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

Language: cpp

Time: 0.002 second

Submitted On: 2025-10-16 20:51:31

#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=0;i<n;i++)
	{
		int ans=0;
		for(int j=0;j<q;j++)
		{
			if(hp[i]<boss[j].fs)
			{
				break;
			}
			else
			{
				ans+=boss[j].sc;
			}
		}
		cout<<ans<<'\n';
	}
}