Codeforces Round 286 (Div. 1)
C
Mr. Kitayuta vs. Bamboos
Codeforces
未评级
原题
← BD →
翻译中…

Mr. Kitayuta's garden is planted with $*n*$ bamboos. (Bamboos are tall, fast-growing tropical plants with hollow stems.) At the moment, the height of the $*i*$-th bamboo is $*h*_{*i*}$ meters, and it grows $*a*_{*i*}$ meters at the end of each day.

翻译中…

Actually, Mr. Kitayuta hates these bamboos. He once attempted to cut them down, but failed because their stems are too hard. Mr. Kitayuta have not given up, however. He has crafted Magical Hammer with his intelligence to drive them into the ground.

翻译中…

He can use Magical Hammer at most $*k*$ times during each day, due to his limited Magic Power. Each time he beat a bamboo with Magical Hammer, its height decreases by $*p*$ meters. If the height would become negative by this change, it will become $0$ meters instead (it does not disappear). In other words, if a bamboo whose height is $*h*$ meters is beaten with Magical Hammer, its new height will be $*max*(0, *h* - *p*)$ meters. It is possible to beat the same bamboo more than once in a day.

翻译中…

Mr. Kitayuta will fight the bamboos for $*m*$ days, starting today. His purpose is to minimize the height of the tallest bamboo after $*m*$ days (that is, $*m*$ iterations of "Mr. Kitayuta beats the bamboos and then they grow"). Find the lowest possible height of the tallest bamboo after $*m*$ days.

翻译中…

Input

翻译中…

The first line of the input contains four space-separated integers $*n*$, $*m*$, $*k*$ and $*p*$ ($1 ≤ *n* ≤ 10^{5}, 1 ≤ *m* ≤ 5000, 1 ≤ *k* ≤ 10, 1 ≤ *p* ≤ 10^{9}$). They represent the number of the bamboos in Mr. Kitayuta's garden, the duration of Mr. Kitayuta's fight in days, the maximum number of times that Mr. Kitayuta beat the bamboos during each day, and the power of Magic Hammer, respectively.

翻译中…

The following $*n*$ lines describe the properties of the bamboos. The $*i*$-th of them ($1 ≤ *i* ≤ *n*$) contains two space-separated integers $*h*_{*i*}$ and $*a*_{*i*}$ ($0 ≤ *h*_{*i*} ≤ 10^{9}, 1 ≤ *a*_{*i*} ≤ 10^{9}$), denoting the initial height and the growth rate of the $*i*$-th bamboo, respectively.

翻译中…

Output

翻译中…

Print the lowest possible height of the tallest bamboo after $*m*$ days.

翻译中…

样例

Input #1
3 1 2 5
10 10
10 10
15 2
Output #1
17
InputCopy OutputCopy
Input #2
2 10 10 1000000000
0 10
0 10
Output #2
10
InputCopy OutputCopy
Input #3
5 3 3 10
9 5
9 2
4 7
9 10
3 8
Output #3
14
InputCopy OutputCopy
题目信息
题号
506C
时间限制
2 s
内存限制
256 MB

题面与样例版权归 Codeforces 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。