Karen and Coffee【前缀和/差分】

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次。

思路

因为最后要得到一个区间内总共合法点，所以很自然会想到前缀和的应用。由于有n个区间需要填充进去，所以用一个for循环来添加区间，维护前缀和，更新n次后得到最终值，s[i]为从0到第i个点处符合条件的总数。要求区间a到b处一共合法的点数为则s[b]-s[a-1]。

a-1是因为要把s[a]也算进去
太基础了写了会显得我很蠢

AC代码

#include<bits/stdc++.h>
using namespace std;

const int N=200005;

int main(){
    int n,k,q;
    while(cin>>n>>k>>q){   //n个配料区间  q个查询区间  至少被k个配料区间覆盖
    	int cnt[N];		  //维护前缀和 
		int s[N];        //s[i]为从0到第i个点处符合条件的总数 
        memset(cnt,0,N);
        memset(s,0,N);
        int l,r;
        for(int i=1;i<=n;i++){
            cin>>l>>r;
            cnt[l]++;
            cnt[r+1]--;
        }
        int num=0;     //num 在当前点处有的合法点个数
        for(int i=1;i<N;i++){
            num+=cnt[i];
            if(num>=k) s[i]=s[i-1]+1;
            else s[i]=s[i-1];
        }
        int a,b;
        for(int i=1;i<=q;i++){
            cin>>a>>b;
            cout<<s[b]-s[a-1]<<endl;
        }
    }
    return 0;
}