1140C C.Playlist（优先队列的应用）

You have a playlist consisting of n songs. The i-th song is characterized by two numbers ti and bi — 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 3 songs having lengths [5,7,4] and beauty values [11,14,6] is equal to (5+7+4)⋅6=96.

You need to choose at most k 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 n and k (1≤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 n lines contains two integers ti and bi (1≤ti,bi≤106) — the length and beauty of i-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,4, so the total pleasure is (4+3+6)⋅6=78.

In the second test case we can choose song 3. The total pleasure will be equal to 100⋅100=10000.
题目大意： 在n个播放列表的歌单中，至多选k首歌，求获得的最大愉悦值。
思路： 先对Beauty值由大到小进行排序，再从头开始遍历用优先队列添加歌的时长，当添加的歌的数目大于k时，去除时长最短的歌（保证时长最大，越往后beauty值越小），再比较愉悦值，找出最大的愉悦值。

#include <iostream>
#include <algorithm>
#include <queue>
using namespace std;
struct node {
	int a, b;
	friend bool operator < (node p, node q) { // 优先队列中重载小于符号，使入队后的歌时长最小的在队首 
		return p.a > q.a;
	}
}g[300005];
bool cmp(node p, node q) { // 开始先排序，使beauty值由大到小排序 
	if(p.b == q.b) return p.a > q.a; // 相同时，找出时长更长的排在前面 
	return p.b > q.b;
}
int main() {
	int n, k;
	scanf("%d %d", &n, &k);
	long long num = 0, sum = 0, maxn = 0; 
	for(int i = 0; i < n; i++) {
		scanf("%d %d", &g[i].a, &g[i].b);
	}
	sort(g, g + n, cmp); 
	priority_queue<node> q;
	for(int i = 0; i < n; i++) {  
		q.push(g[i]); 
		sum += g[i].a; // 获取当前时长 
		if(q.size() > k) { // 歌曲数目超过k时，删除队首元素 
			node ne = q.top();
			sum -= ne.a; // 时长减去队列中最小的 
			q.pop(); // 出队 
		}
		maxn = max(maxn, sum * g[i].b); // 找出当前最大愉悦值 
	}
	printf("%I64d\n", maxn);
	return 0;
}

想了下上面的的代码，发现不必在结构体中重载小于号，因为队列存的只是歌时长，直接使用优先队列即可，代码如下：

#include <iostream>
#include <algorithm>
#include <queue>
using namespace std;
struct node {
	int a, b;
}g[300005];
bool cmp(node p, node q) { // 开始先排序，使beauty值由大到小排序 
	if(p.b == q.b) return p.a > q.a; // 相同时，找出时长更长的排在前面 
	return p.b > q.b;
}
int main() {
	int n, k;
	scanf("%d %d", &n, &k);
	long long num = 0, sum = 0, maxn = 0; 
	for(int i = 0; i < n; i++) {
		scanf("%d %d", &g[i].a, &g[i].b);
	}
	sort(g, g + n, cmp); 
	priority_queue<int, vector<int>, greater<int> > q;
	for(int i = 0; i < n; i++) {  
		q.push(g[i].a); 
		sum += g[i].a; // 获取当前时长 
		if(q.size() > k) { // 歌曲数目超过k时，删除队首元素 
			sum -= q.top(); // 时长减去队列中最小的 
			q.pop(); // 出队 
		}
		maxn = max(maxn, sum * g[i].b); // 找出当前最大愉悦值 
	}
	printf("%I64d\n", maxn);
	return 0;
}