Codeforces Round #523 (Div. 2) D. TV Shows 模拟（多重集 先把所有区间加入多重集合）+贪心+二分

 1 #include<bits/stdc++.h>
 2 #define FOR(i,f_start,f_end) for(int i=f_start;i<=f_end;i++)
 3 #define MS(arr,arr_value) memset(arr,arr_value,sizeof(arr)) 
 4 #define F first 
 5 #define S second
 6 #define pii pair<int ,int >
 7 #define mkp make_pair
 8 #define pb push_back
 9 #define arr(zzz) array<ll,zzz>
10 #define ll long long 
11 using namespace std;
12 const int maxn=1e6+100;
13 const int inf=0x3f3f3f3f;
14 const int mod=1e9+7;
15 vector<pii>v;
16 multiset<pii>s;
17 int main(){
18     int n,x,y;
19     scanf("%d%d%d",&n,&x,&y);
20     int a,b;
21     for(int i=1;i<=n;i++)scanf("%d%d",&a,&b),v.pb({a,b}),s.insert({b,a});
22     sort(v.begin(),v.end(),[](pii a,pii b){return a.F<b.F;});
23      ll ans=0;
24     for(int i=0;i<n;i++){
25         ll tmp=x+1ll*y*(v[i].S-v[i].F);
26         if(s.size()==0||(*s.begin()).F>=v[i].F){
27             ans+=tmp;
28             ans%=mod;
29             continue;
30         }
31         multiset<pii>::iterator it=s.lower_bound({v[i].F,-1});
32         it--;
33         if(tmp<=1ll*y*(v[i].S-(*(it)).F)){
34         ans+=tmp;    
35         ans%=mod;
36             continue;
37         }
38         ans+=1ll*y*(v[i].S-(*(it)).F);
39         ans%=mod;
40         s.erase(it);
41     }
42     cout<<ans<<endl;
43     
44     return 0;
45 }