C. Playlist

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

题意：给len数组和对应beauty数组，选择不超过k长的序列使得(len[i]+len[i+1]...)*(  min(beatuty[i],beauty[i+1]...)   )最大；

思路：按beauty大到小排序，枚举beauty从大到小，保持集合不超过k，每次超过抛弃集合小的(multiset,包含重复)；

#include<algorithm>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstring>
#include<sstream>
#include<cstdio>
#include<ctime>
#include<map>
#include<stack>
#include<string>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-6
#define PI acos(-1)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define FAST ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);endl '\n'
ll gcd(ll a,ll b){while(b^=a^=b^=a%=b);return a;}
const int maxn=3e5+9;
const int mod=1e9+7;

template <class T>
inline void sc(T &ret)
{
    char c;
    ret = 0;
    while ((c = getchar()) < '0' || c > '9');
    while (c >= '0' && c <= '9')
    {
        ret = ret * 10 + (c - '0'), c = getchar();
    }
}

ll power(ll x,ll n)
{
    ll ans=1;
    while(n)
    {
        if(n&1) ans=ans*x%mod;
        x=x*x%mod;
        n>>=1;
    }
    return ans;
}

pair<int,int>a[maxn];
bool cmp(pair<int,int>a,pair<int,int>b)
{
    if(a.second==b.second) return a.first>b.first;
    return a.second>b.second;
}
multiset<int>s;

int main()
{
    //freopen("input.txt", "r", stdin);
    int n,k;
    cin>>n>>k;
    for(int i=0;i<n;i++)
    {
        cin>>a[i].first>>a[i].second;
    }
    sort(a,a+n,cmp);
    ll ans=0;
    ll len=0;
    for(int i=0;i<n;i++)
    {
        int bt=a[i].second;
        len+=a[i].first;
        ans=max(ans,len*bt);
        s.insert(a[i].first);
        if(s.size()>=k)
        {
            len-=*s.begin();
            s.erase(s.begin());
        }
    }
    cout<<ans<<endl;
    return 0;
}