【组合数学】D. Rescue Nibel! -- codeforces round #672 (Div. 2)

传送门

题意

有n条线段，给出起点和终点。
我们需要找the number of sets of k segments such that these k segments intersect at least in one point.

思路

从左往右遍历，当遇到一个新的线段的起点，且当前位置的线段数目大于等于k，则在剩下cnt-1条中选出k-1条，与当前线段贡献一个set。

代码

#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define U unsigned
#define P std::pair<int,int>
#define LL long long
#define pb push_back
#define MP std::make_pair
#define V std::vector<int>
#define all(x) x.begin(),x.end()
#define CLR(i,a) memset(i,a,sizeof(i))
#define FOR(i,a,b) for(int i = a;i <= b;++i)
#define ROF(i,a,b) for(int i = a;i >= b;--i)
#define DEBUG(x) std::cerr << #x << '=' << x << std::endl
#define INF 0x3f3f3f3f
#define mod 998244353
const int N=3e5+5;
LL pt[2*N],fc[N],n,k,n2;

bool cmp(int a,int b){
	if(abs(a)!=abs(b)) return abs(a)<abs(b);  //绝对值小的靠前 
	return a>b;    //如果在同一点结束或开始，则先处理开始 
}

LL qpow(LL a,int n){
	LL ans = 1;
	while(n){
		if(n&1) ans=ans*a%mod;
		a=a*a%mod;
		n>>=1;
	}
	return ans;
}

LL C(int a,int b){
	return fc[a]*qpow(fc[b],mod-2)%mod*qpow(fc[a-b],mod-2)%mod;
}

int main(){
	scanf("%d%d",&n,&k);
	int l,r;
	FOR(i,1,n){
		scanf("%d%d",&l,&r);
		pt[++n2] = l;
		pt[++n2] = -r;
	}
	fc[0] = fc[1] = 1;
	FOR(i,1,N) fc[i] = (LL)fc[i-1]*i%mod;
	sort(pt+1,pt+1+n2,cmp);
	int cnt = 0;
	LL ans = 0;
	FOR(i,1,n2){
		if(pt[i]>0) cnt++;
		else cnt--;
		if(pt[i]>0&&cnt>=k) ans = (ans + C(cnt-1,k-1))%mod;
	}
	printf("%lld\n",ans);
}