Problem:
Score : 600 points

Problem Statement

Silver Fox is fighting with N monsters.

The monsters are standing in a row, and we can assume them to be standing on a number line. The i-th monster, standing at the coordinate X_i, has the health of H_i.

Silver Fox can use bombs to attack the monsters.
Using a bomb at the coordinate x decreases the healths of all monsters between the coordinates x-D and x+D (inclusive) by A.
There is no way other than bombs to decrease the monster's health.

Silver Fox wins when all the monsters' healths become 0 or below.

Find the minimum number of bombs needed to win.

Constraints

1 \leq N \leq 2 \times 10^5

0 \leq D \leq 10^9

1 \leq A \leq 10^9

0 \leq X_i \leq 10^9

1 \leq H_i \leq 10^9

X_i are distinct.

All values in input are integers.

Input

Input is given from Standard Input in the following format:

N D A
X_1 H_1
:
X_N H_N

Output

Print the minimum number of bombs needed to win.

Sample Input 1

3 3 2
1 2
5 4
9 2

Sample Output 1

2

First, let us use a bomb at the coordinate 4 to decrease the first and second monsters' health by 2.

Then, use a bomb at the coordinate 6 to decrease the second and third monsters' health by 2.

Now, all the monsters' healths are 0.
We cannot make all the monsters' health drop to 0 or below with just one bomb.

Sample Input 2

9 4 1
1 5
2 4
3 3
4 2
5 1
6 2
7 3
8 4
9 5

Sample Output 2

5

We should use five bombs at the coordinate 5.

Sample Input 3

3 0 1
300000000 1000000000
100000000 1000000000
200000000 1000000000

Sample Output 3

3000000000

Watch out for overflow.

Solution in Java8 (OpenJDK 1.8.0) (judge verdict: Time Limit Exceeded)

import java.util.*;
import java.util.stream.Collectors;
import java.io.*;
import java.nio.charset.StandardCharsets;

public class Main {
	int N;
	long D, A;
	List<Pair> list;
	Deque<Pair> que;
	long minPoint = Long.MAX_VALUE / 2;
	long result = 0;

	static class Pair {
		long X, H;

		Pair(long X, Long H) {
			this.X = X;
			this.H = H;
		}
	}

	public static void main(String[] args) throws IOException {
		InputStreamReader reader = new InputStreamReader(System.in, StandardCharsets.UTF_8);
		BufferedReader in = new BufferedReader(reader);
		Main ins = new Main(in);
		ins.calc();
		ins.showResult();
	}

	Main(BufferedReader in) throws IOException {
		String[] tokens = in.readLine().split(" ");
		N = Integer.parseInt(tokens[0]);
		D = Long.parseLong(tokens[1]);
		A = Long.parseLong(tokens[2]);
		list = new ArrayList<>();
		for (int i = 0; i < N; ++i) {
			tokens = in.readLine().split(" ");
			long x = Long.parseLong(tokens[0]);
			long h = Long.parseLong(tokens[1]);
			this.list.add(new Pair(x, h));
		}
		Collections.sort(list, new Comparator<Pair>() {
			@Override
			public int compare(Pair o1, Pair o2) {
				return Long.compare(o1.X, o2.X);
			}
		});
		this.que = new ArrayDeque<>(N);
		que.addAll(list);
	}

	void apply(long point) {
		long times = que.peek().H / A;
		if (que.peek().H % A != 0) {
			times++;
		}
		long hp = times * A;

		Deque<Pair> temp = new ArrayDeque<>();
		while (!que.isEmpty() && que.peek().X <= point + D) {
			Pair pair = que.pollFirst();
			pair.H = pair.H - hp;
			if (pair.H > 0) {
				temp.addLast(pair);
			}
		}

		temp.addAll(this.que);
		this.que = temp;

		result += times;
	}

	void calc() {
		while (!que.isEmpty()) {
			// 爆弾を適用する座標を求める
			long point = que.peekFirst().X;
			point += D;
			// 爆弾をpointに対して，list.get(0)にいるモンスターを倒せる回数適用する
			apply(point);
		}
	}

	void showResult() {
		System.out.println(result);
	}
}