Codeforces Round #697 (Div. 3)E - Advertising Agency

组合数模板题= =

#include<iostream>
#include<algorithm>
#include<cstring>
#include<string>
#include<map>
#include<queue>
#include<vector>
#include<stack>
#define int long long 
using namespace std;
const int mod = 1e9 + 7;
int a[1009];
int fac[200005];
int cmp(int x, int y) {
	return x > y;
}
int pow_(int a, int b) {//快速幂
	int cnt = 1, base = a;
	while (b) {
		if (b & 1)cnt = cnt * base%mod;
		base = base * base%mod;
		b >>= 1;
	}
	return cnt;
}
void init() {//预处理
	fac[0] = 1;
	for (int i = 1; i <= 1009; i++)fac[i] = fac[i - 1] * i%mod;
}
int C(int n, int m1) {//组合数模板
	if (n < m1)return 0;
	return fac[n] * pow_(fac[m1] * fac[n - m1] % mod, mod - 2) % mod;
}
signed main()
{
	int t;
	init();
	scanf("%lld", &t);
	while (t--) {
		map<int, int>ma;
		int n, k;
		scanf("%lld%lld", &n, &k);
		for (int i = 1; i <= n; i++) {
			scanf("%lld", &a[i]);
			ma[a[i]]++;
		}
		sort(a + 1, a + 1 + n, cmp);
		int ans = 1;
		int flag = 1;
		for (int i = 1; i <= n; i++) {
			if (a[i] == a[i - 1]&&i!=n)continue;
			else {
				if (ma[a[i]] < k)k -= ma[a[i]];
				else if (ma[a[i]] == k) {
					flag = 0;
					k -= ma[a[i]];
					break;
				}
				else {
					ans = ma[a[i]];
					break;
				}
			}
		}
		if (!flag)printf("1\n");
		else {
			printf("%lld\n", C(ans, k));
		}
	}
	return 0;
}