Rest Stops(贪心)

time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
Farmer John and his personal trainer Bessie are hiking up Mount Vancowver. For their purposes (and yours), the mountain can be represented as a long straight trail of length L meters (1≤L≤106). Farmer John will hike the trail at a constant travel rate of rF seconds per meter (1≤rF≤106). Since he is working on his stamina, he will not take any rest stops along the way.

Bessie, however, is allowed to take rest stops, where she might find some tasty grass. Of course, she cannot stop just anywhere! There are N rest stops along the trail (1≤N≤105); the i-th stop is xi meters from the start of the trail (0<xi<L) and has a tastiness value ci (1≤ci≤106). If Bessie rests at stop i for t seconds, she receives ci⋅t tastiness units.

When not at a rest stop, Bessie will be hiking at a fixed travel rate of rB seconds per meter (1≤rB≤106). Since Bessie is young and fit, rB is strictly less than rF.

Bessie would like to maximize her consumption of tasty grass. But she is worried about Farmer John; she thinks that if at any point along the hike she is behind Farmer John on the trail, he might lose all motivation to continue!

Help Bessie find the maximum total tastiness units she can obtain while making sure that Farmer John completes the hike.

Input
The first line of input contains four integers: L, N, rF, and rB. The next N lines describe the rest stops. For each i between 1 and N, the i+1-st line contains two integers xi and ci, describing the position of the i-th rest stop and the tastiness of the grass there.

It is guaranteed that rF>rB, and 0<x1<…<xN<L. Note that rF and rB are given in seconds per meter!

Output
A single integer: the maximum total tastiness units Bessie can obtain.

Example
inputCopy
10 2 4 3
7 2
8 1
outputCopy
15
Note
In this example, it is optimal for Bessie to stop for 7 seconds at the x=7 rest stop (acquiring 14 tastiness units) and then stop for an additional 1 second at the x=8 rest stop (acquiring 1 more tastiness unit, for a total of 15 tastiness units).
思路：贪心，到尽量多草的地方吃草

#include <bits/stdc++.h>
#define ll long long
using namespace std;

const ll M=1e6+10;
ll l,n,r[2];
struct xx{
	ll x,c;
	bool operator <(xx y)const{
		if(c==y.c)
			return x>y.x;
		return c>y.c;
	}
}a[M];
int main(){
	cin>>l>>n>>r[0]>>r[1];
	for(ll i=0;i<n;i++)
		cin>>a[i].x>>a[i].c;
	sort(a,a+n);
	ll ans=0,last=0,dr=r[0]-r[1],sit=0;
	while(1){
		ans+=dr*(a[sit].x-last)*a[sit].c;
		last=a[sit].x;
		ll j=sit+1;
		while(j<n && a[j].x<a[sit].x) j++;
		if(j==n) break;
		sit=j;
	}
	cout<<ans;
	return 0;
}