Codeforces Round #419 B

#include "iostream"
#include "string.h"
#include "stack"
#include "queue"
#include "string"
#include "vector"
#include "set"
#include "map"
#include "algorithm"
#include "stdio.h"
#include "math.h"
#define bug(x) cout<<x<<" "<<"UUUUU"<<endl;
#define mem(a) memset(a,0,sizeof(a))
using namespace std;
const int N=2e5+100;
int n,k,q,l,r,a,b;
int f[N],sum[N];
int main(){
    scanf("%d%d%d",&n,&k,&q);
    for(int i=1; i<=n; ++i){
        scanf("%d%d",&l,&r);
        f[l]++,f[r+1]--;
    }
    for(int i=2; i<N; ++i){
        f[i]=f[i]+f[i-1];
    }
    if(f[1]>=k) sum[1]++;
    for(int i=2; i<N; ++i){
        if(f[i]>=k){
            sum[i]=sum[i-1]+1;
        }
        else sum[i]=sum[i-1];
    }
    for(int i=1; i<=q; ++i){
        scanf("%d%d",&a,&b);
        printf("%d\n",sum[b]-sum[a-1]);
    }
    return 0;
}