CodeForces-1140C-Playlist

题目：

Description:

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.

题目分析：

自己对STL的掌握不够，优先队列也不太会运用上。一般都是看到题目根本不会想着往优先队列方向上想过去，还是要强迫自己多做题，多往优先队列上想。先将所有的歌曲按照歌曲的优美程度从大到小排个序，然后再依此把对应的时间放入优先队列中，当满了k个元素时则进性删除时间 t 最小的，因为我已经把美丽值从大到小排过序了，我当前更新的第 i 首歌曲的美丽值必定是整个优先队列中美丽值最小的那一个。（具体看代码）

代码：

#include<iostream>
#include<cstdio>
#include<cstring>
#include<vector>
#include<queue>
#include<algorithm>
#define N 300005
using namespace std;
int n,k,num=0;
long long ans=0,sum=0;
struct ljh
{
	long long t,b;
	friend bool operator < (ljh u,ljh v)
	{
		return u.b>v.b;
	}
}e[N];
priority_queue<int,vector<int>,greater<int> >q;
int main()
{
	scanf("%d%d",&n,&k);
	for(int i=1;i<=n;i++)
	scanf("%lld%lld",&e[i].t,&e[i].b);
	sort(e+1,e+n+1);
	for(int i=1;i<=n;i++)
	{
		bool flag=0;
		q.push(e[i].t);
		sum+=e[i].t;
		while(q.size()>k)
		{
			sum-=q.top();
			if(q.top()==e[i].t)flag=1;//如果我当前队列已经满了k首歌曲，并且我当前放进去的第i首歌的时间t最小，那么我就不需要把这首歌放入队列，自然也就不存在用第i首歌的美丽值更新了
			q.pop();
		}
		if(!flag)
		ans=max(ans,sum*e[i].b); 
	}
	printf("%lld",ans);
}