Supermarket (heap overload

Add link description

#include<bits/stdc++.h>
using namespace std;
const int N=1e5+9;
int arr[N];
int n,m,q;
struct node {
    
    int price,id,ed;
    bool operator< (const node &ch)const{
    
        if(ch.price!=price)return ch.price<price;
        return ch.id<id;
    }
};
priority_queue<node> h;
vector<node> v[N];
int main(){
    
    cin>>n>>m>>q;
    for(int i=1;i<=n;i++){
    
        scanf("%d",&arr[i]);
        h.push({
    arr[i],i,m});
    }
    while(q--){
    
        int x,y,l,r;
        scanf("%d%d%d%d",&x,&y,&l,&r);
        if(y<10)y*=10;
        int p=arr[x]*y/100;
        v[l].push_back({
    p,x,r});
    }
    for(int i=1;i<=m;i++){
    
        for(int j=0;j<v[i].size();j++)h.push(v[i][j]);
        while(h.size()&&h.top().ed<i)h.pop();
        cout<<h.top().id<<" ";
    }

    return 0;
}