1140C.md (1540B)
1 Source: https://codeforces.com/problemset/problem/1140/C 2 3 C. Playlist 4 5 time limit per test 6 7 2 seconds 8 9 memory limit per test 10 11 256 megabytes 12 13 input 14 15 standard input 16 17 output 18 19 standard output 20 21 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$. 22 23 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. 24 25 Input 26 27 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. 28 29 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. 30 31 Output 32 33 Print one integer — the maximum pleasure you can get. 34 35 Examples 36 37 Input 38 39 ``` 40 4 3 41 4 7 42 15 1 43 3 6 44 6 8 45 ``` 46 47 Output 48 49 ``` 50 78 51 ``` 52 53 Input 54 55 ``` 56 5 3 57 12 31 58 112 4 59 100 100 60 13 55 61 55 50 62 ``` 63 64 Output 65 66 ``` 67 10000 68 ``` 69 70 Note 71 72 In the first test case we can choose songs ${1, 3, 4}$, so the total pleasure is $(4 + 3 + 6) \cdot 6 = 78$. 73 74 In the second test case we can choose song $3$. The total pleasure will be equal to $100 \cdot 100 = 10000$.