Submission #2713815

---

Source Code Expand

#include<iostream>
#include<vector>
#include<algorithm>
#include<map>
#include<set>
using namespace std;

using ll = long long;

ll dp[51][51];

ll comb(int n, int r) {
       if(n == r) return dp[n][r] = 1;
       if(r == 0) return dp[n][r] = 1;
       if(r == 1) return dp[n][r] = n;
       if(dp[n][r]) return dp[n][r];
       return dp[n][r] = comb(n-1,r) + comb(n-1,r-1);
}

int main() {
    int n, a, b;
    cin >> n >> a >> b;
    vector<ll> v(n);
    map<ll, int> mp;
    for(int i = 0; i < n; i++) cin >> v[i], mp[v[i]]++;
    sort(v.begin(), v.end(), greater<ll>());

    double ans = 0;
    set<ll, greater<ll> > st;
    for(int i = 0; i < a; i++) {
        ans += v[i];
        st.insert(v[i]);
    }
    ans /= a;
    printf("%lf\n", ans);

    if(st.size() == 1) {
        ll sum = 0;
        for(int i = 1; i <= min(mp[*st.begin()], b); i++) {
            sum += comb(mp[*st.begin()], i);
        }
        printf("%lld\n", sum);
    } else {
        auto iter = st.begin();
        int num = a;
        for(int i = 0; i < st.size()-1; i++) {
            num -= mp[*iter];
            ++iter;
        }
        printf("%lld\n", comb(mp[*iter], num));
    }
    return 0;
}

Submission Info

Judge Result