https://codeforces.com/contest/1140/problem/C

題解：

貪心

根據b進行排序，枚舉b

/* *@Author: STZG *@Language: C++ */ #include <bits/stdc++.h> #include<iostream> #include<algorithm> #include<cstdlib> #include<cstring> #include<cstdio> #include<string> #include<vector> #include<bitset> #include<queue> #include<deque> #include<stack> #include<cmath> #include<list> #include<map> #include<set> //#define DEBUG #define RI register int using namespace std; typedef long long ll; //typedef __int128 lll; const int N=300000+10; const int M=100000+10; const int MOD=1e9+7; const double PI = acos(-1.0); const double EXP = 1E-8; const int INF = 0x3f3f3f3f; int t,n,m,k; ll ans,cnt,flag,temp,sum; int a[N]; char str; struct node{int v,w;bool operator <(const node &S)const{return S.w== w ? v > S.v:w > S.w;} }e[N]; priority_queue<int, vector<int>, greater<int> > q; int main() { #ifdef DEBUGfreopen("input.in", "r", stdin);//freopen("output.out", "w", stdout); #endif//ios::sync_with_stdio(false);//cin.tie(0);//cout.tie(0);//scanf("%d",&t);//while(t--){scanf("%d%d",&n,&k);for(int i=1;i<=n;i++){scanf("%d%d",&e[i].v,&e[i].w);}sort(e+1,e+n+1);for(int i=1;i<=n;i++){if (i <= k) {q.push(e[i].v);sum += e[i].v;ans = max(ans, sum*e[i].w);}else {int t = q.top();if (e[i].v > t) {sum -= t;sum += e[i].v;q.pop();q.push(e[i].v);ans = max(ans,e[i].w*sum);}}}printf("%lld\n", ans);//}#ifdef DEBUGprintf("Time cost : %lf s\n",(double)clock()/CLOCKS_PER_SEC); #endif//cout << "Hello world!" << endl;return 0; }

?

總結

以上是生活随笔為你收集整理的Playlist的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。