codeforces:1140C(greedy)

贪心

typedef long long ll;

#include<bits/stdc++.h>
using namespace std;
#define maxn 300050

struct Sang{
    ll x,y;
    bool operator < (const Sang & t) const{
        return  y > t.y;
    }
    void putit(ll a,ll b){
        x=a,y=b;
    }
};

Sang s[maxn];

int main(){
    int n,k;
    scanf("%d%d",&n,&k);
    for(int i=0;i<n;i++){
        ll t1,t2;
        scanf("%lld%lld",&t1,&t2);
        s[i].putit(t1,t2);
    }
    sort(s,s+n);
    priority_queue<ll,vector<ll>,greater<ll> > q;
    ll ans,sum;
    ans = sum = 0;
    for(int i=0;i<n;i++){
        sum += s[i].x;
        q.push(s[i].x);
        if(q.size() > k) sum-=q.top(),q.pop();
        ans = max(ans,sum*s[i].y);
    }
    printf("%lld\n",ans);
    return 0;
}