Playlist CodeForces - 1140C（思维）

You have a playlist consisting of nn songs. The ii-th song is characterized by two numbers titi and bibi — its length and beauty respectively. The pleasure of listening to set of songs is equal to the total length of the songs in the set multiplied by the minimum beauty among them. For example, the pleasure of listening to a set of 33 songs having lengths [5,7,4][5,7,4] and beauty values [11,14,6][11,14,6] is equal to (5+7+4)⋅6=96(5+7+4)⋅6=96.

You need to choose at most kk songs from your playlist, so the pleasure of listening to the set of these songs them is maximum possible.

Input
The first line contains two integers nn and kk (1≤k≤n≤3⋅1051≤k≤n≤3⋅105) – the number of songs in the playlist and the maximum number of songs you can choose, respectively.

Each of the next nn lines contains two integers titi and bibi (1≤ti,bi≤1061≤ti,bi≤106) — the length and beauty of ii-th song.

Output
Print one integer — the maximum pleasure you can get.

Examples
Input
4 3
4 7
15 1
3 6
6 8
Output
78
Input
5 3
12 31
112 4
100 100
13 55
55 50
Output
10000
Note
In the first test case we can choose songs 1,3,41,3,4, so the total pleasure is (4+3+6)⋅6=78(4+3+6)⋅6=78.

In the second test case we can choose song 33. The total pleasure will be equal to 100⋅100=10000100⋅100=10000.
对于这种有两种判断指标的，就是对一种排好序之后，对另一个进行判断。
我们按着di降序排列，这样的话，每次遇到的就是最小的di。由于我们只能拿k个，肯定是要拿最大的那k个，所以我们用优先队列维护
代码如下：

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

const int maxx=3e5+100;
struct node{
	ll t,b;
	bool operator <(const node &a)const{
		return a.b<b;
	}
}p[maxx];
int n,k;

int main()
{
	scanf("%d%d",&n,&k);
	for(int i=1;i<=n;i++) scanf("%lld%lld",&p[i].t,&p[i].b);
	sort(p+1,p+1+n);
	priority_queue<int,vector<int>,greater<int> >q;
	ll sum=0;
	ll _max=0;
	for(int i=1;i<=n;i++)
	{
		if(q.size()+1<=k)
		{
			q.push(p[i].t);
			sum+=p[i].t;
			_max=max(_max,(ll)sum*(ll)p[i].b); 
		}
		else
		{
			if(q.top()<p[i].t)
			{
				sum=sum-q.top()+p[i].t;
				q.pop();
				q.push(p[i].t);
				_max=max(_max,(ll)sum*(ll)p[i].b); 
			}
			_max=max(_max,(ll)sum*(ll)p[i].b);
		}
	}
	cout<<_max<<endl;
}

努力加油a啊，(^o)/~