Submission #1183578

---

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define vec vector
#define ll long long

ll dp[55][55];

ll combination(int p, int q)
{
	if (p < q) {
		return 0;
	}
	if (dp[p][q] > 0) return dp[p][q];
	if (!q) return 1;
	if (p == 1) return 1;
	dp[p][q] = combination(p - 1, q) + combination(p - 1, q - 1);
	return dp[p][q];
}

int main(void)
{
	int n, a, b;
	cin >> n >> a >> b;
	vec<double> v(n);
	rep(i, n) cin >> v[i];
	sort(v.begin(), v.end());
	reverse(v.begin(), v.end());

	double sum = 0;
	
	rep(i, a) sum += v[i];
	cout << sum / (double)a << endl;

	int c = 1;
	int keep = 0;
	while(keep + c < n) {
		if (v[keep + c] == v[keep]) {
			c++;
			continue;
		} else {
			if (keep + c > a) break;  
			keep += c;
			c = 1;
		}
	}
	
	rep(i, 55) rep(j, 55) dp[i][j] = - 1;

	if (keep == 0) {
		ll sum = 0;
		for (int i = a; i <= min(keep + c, b); i++) {
			sum += combination(c, i);
		}
		cout << sum << endl;
		return 0;
	}
	cout << combination(c, a - keep) << endl;
	return 0;
}

Submission Info

Judge Result