Submission #1243910

---

Source Code Expand

#include <iostream>
#include <cmath>
#include <algorithm>
using namespace std;
typedef long long int ll;
#define MOD (1e9+7);
#define INF (2e9)

ll c(int x, int y) {//xCy
    ll a = 1;
    for (int i = 1; i<=y; i++) {
        a *= x--;
        a/=i;
    }
    return a;

}

int main(void) {
    int n, a, b;
    cin >> n >> a >> b;
    ll *v = new ll[n];
    for (int i = 0; i<n; i++) {
        cin >> v[i];
    }
    sort(v, v + n);
    ll min = v[n - a];
    ll ans = 0;
    ll ans_max=0;
    double ans_maxp;
    if (v[n - 1] == min) {
        ans_maxp=min;
        int i;
        for (i = 0; i<n; i++) {
            if (v[n - i - 1] != min) {
                break;
            }
        }
        //i = min no kosu
        while (a <= b && a <= i) {
            ans += c(i, a);
            a++;
        }
    }
    else {
        for(int k=n-a;k<n;k++){
            ans_max+=v[k];
        }
        ans_maxp=(double)ans_max/a;
        int minp, minm;
        for (minp = n - a; v[minp] == min; minp++) {}
        for (minm = n - a; v[minm] == min&&minm >= 0; minm--) {}
        int kosu = minp - minm - 1;
        a -= n - minp;
        ans = c(kosu, a);

        
    }
    cout << ans_maxp<<"\n"<<ans << "\n";
    return 0;
}

Submission Info

Judge Result