CF419 div2B. Karen and Coffee

B. Karen and Coffee
time limit per test
2.5 seconds
memory limit per test
512 megabytes
input
standard input
output
standard output

To stay woke and attentive during classes, Karen needs some coffee!

Karen, a coffee aficionado, wants to know the optimal temperature for brewing the perfect cup of coffee. Indeed, she has spent some time reading several recipe books, including the universally acclaimed "The Art of the Covfefe".

She knows n coffee recipes. The i-th recipe suggests that coffee should be brewed between li and ri degrees, inclusive, to achieve the optimal taste.

Karen thinks that a temperature is admissible if at leastk recipes recommend it.

Karen has a rather fickle mind, and so she asks q questions. In each question, given that she only wants to prepare coffee with a temperature betweena and b, inclusive, can you tell her how many admissible integer temperatures fall within the range?

Input

The first line of input contains three integers, n,k (1 ≤ k ≤ n ≤ 200000), andq (1 ≤ q ≤ 200000), the number of recipes, the minimum number of recipes a certain temperature must be recommended by to be admissible, and the number of questions Karen has, respectively.

The next n lines describe the recipes. Specifically, thei-th line among these contains two integersli andri (1 ≤ li ≤ ri ≤ 200000), describing that thei-th recipe suggests that the coffee be brewed betweenli andri degrees, inclusive.

The next q lines describe the questions. Each of these lines containsa and b, (1 ≤ a ≤ b ≤ 200000), describing that she wants to know the number of admissible integer temperatures betweena and b degrees, inclusive.

Output

For each question, output a single integer on a line by itself, the number of admissible integer temperatures betweena and b degrees, inclusive.

Examples
Input
3 2 4
91 94
92 97
97 99
92 94
93 97
95 96
90 100
Output
3
3
0
4
Input
2 1 1
1 1
200000 200000
90 100
Output
0

思路:运用递推的方式依次从每个区间的起点往后加1,这样就可以在n的复杂度内枚举出数字的出现次数,注意区间结束应该-1,标志区间结束。按照递推的关系,每个数的出现次数都要
加上前一个数的出现次数,当区间结束,应当减去1.当递推的同时再用一个c数组也从开始递推,同样是加上前一个,但是同时也要判断此刻的数是否大于k如果大于,就再加一,这样就
可以确定在一定范围内的数大于k的个数。
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值