Preparing NOJ

# Playlist

2000ms 262144K

## Description:

You have a playlist consisting of $n$ songs. The $i$-th song is characterized by two numbers $t_i$ and $b_i$ — 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) \cdot 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 \le k \le n \le 3 \cdot 10^5$) – 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 $t_i$ and $b_i$ ($1 \le t_i, b_i \le 10^6$) — the length and beauty of $i$-th song.

## Output:

Print one integer — the maximum pleasure you can get.

## Sample Input:

 4 3 4 7 15 1 3 6 6 8

## Sample Output:

 78

## Sample Input:

 5 3 12 31 112 4 100 100 13 55 55 50

## Sample Output:

 10000

## Note:

In the first test case we can choose songs ${1, 3, 4}$, so the total pleasure is $(4 + 3 + 6) \cdot 6 = 78$.

In the second test case we can choose song $3$. The total pleasure will be equal to $100 \cdot 100 = 10000$.

Info

Provider CodeForces

Code CF1140C

Tags

brute forcedata structuressortings

Submitted 65

Passed 8

AC Rate 12.31%

Date 07/21/2019 13:33:23

Related

Nothing Yet