标签：set ll CF 1140C choose pleasure 100 贪心 songs

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.
代码：

#include <bits/stdc++.h>
#define maxn 300005
using namespace std;
typedef long long ll;
inline ll read(){
    	ll x=0,f=0;char ch=getchar();
    	while(ch>'9'||ch<'0')f|=ch=='-',ch=getchar();
    	while(ch>='0'&&ch<='9')x=(x<<3)+(x<<1)+(ch^48),ch=getchar();
    	return f?-x:x;
}
struct point{
	ll a,b;
	bool operator<(const point&t)const{
		return b>t.b;
	}
}p[maxn];
ll max(ll a,ll b){return a>b?a:b;}
int main(){
	int n=read(),k=read();
	for(int i=0;i<n;++i)p[i]={read(),read()};
	sort(p,p+n);
	priority_queue<ll,vector<ll>,greater<ll>>q;
	ll sum=0,ans=0;
	for(int i=0;i<n;++i){
		q.push(p[i].a);
		sum+=p[i].a;
		if(q.size()>k)sum-=q.top(),q.pop();
		ans=max(ans,sum*p[i].b);
	}
	printf("%I64d\n",ans);
	return 0;
}

标签：set,ll,CF,1140C,choose,pleasure,100,贪心,songs
来源： https://blog.csdn.net/u014137295/article/details/88767443

本站声明： 1. iCode9 技术分享网（下文简称本站）提供的所有内容，仅供技术学习、探讨和分享；
2. 关于本站的所有留言、评论、转载及引用，纯属内容发起人的个人观点，与本站观点和立场无关；
3. 关于本站的所有言论和文字，纯属内容发起人的个人观点，与本站观点和立场无关；
4. 本站文章均是网友提供，不完全保证技术分享内容的完整性、准确性、时效性、风险性和版权归属；如您发现该文章侵犯了您的权益，可联系我们第一时间进行删除；
5. 本站为非盈利性的个人网站，所有内容不会用来进行牟利，也不会利用任何形式的广告来间接获益，纯粹是为了广大技术爱好者提供技术内容和技术思想的分享性交流网站。