S - Karen and Coffee（前缀和）

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 least k 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 between a 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), and q (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, the i-th line among these contains two integers li and ri (1 ≤ li ≤ ri ≤ 200000), describing that the i-th recipe suggests that the coffee be brewed between li and ri degrees, inclusive.

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

Output
For each question, output a single integer on a line by itself, the number of admissible integer temperatures between a 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

题目大意：
给出三个数n,k,q,接下来给出k个区间，区间内元素+1，然后给出q个查询，问查询区间内值大于等于k的元素有多少个

解题思路：
暴力会超时，用前缀和可以降低时间复杂度。

完整代码：
#include
using namespace std;
int main()
{
int n,k,q,a[200010]={0};
cin>>n>>k>>q;
while(n–){
int x,y;
scanf("%d%d",&x,&y);
a[x]++;
a[y+1]–;
}
for(int i=1;i<=200005;i++){ //伪前缀和
a[i]+=a[i-1];
}
for(int i=1;i<=200005;i++){ //修改值
if(a[i]>=k){
a[i]=1;
}else{
a[i]=0;
}
}
for(int i=1;i<=200005;i++){ //前缀和
a[i]+=a[i-1];
}
while(q–){
int x,y,ans=0;
scanf("%d%d",&x,&y);
cout<<a[y]-a[x-1]<<endl;
}
}