Submission #1182007

---

Source Code Expand

#define _USE_MATH_DEFINES
#include <cstdio>
#include <iostream>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <complex>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <limits>
#include <climits>
#include <cfloat>
#include <functional>
#include <iterator>
using namespace std;

long long combination(int n, int r)
{
    if(n < r)
        return 0;
    if(n-r < r)
        r = n-r;
    long long ret = 1;
    for(int i=0; i<r; i++){
        ret *= (n--);
        ret /= i+1;
    }
    return ret;
}

int main()
{
    int n, a, b;
    cin >> n >> a >> b;
    vector<long long> v(n);
    map<long long, int> cnt;
    for(int i=0; i<n; ++i){
        cin >> v[i];
        ++ cnt[v[i]];
    }

    sort(v.rbegin(), v.rend());
    double ans1 = accumulate(v.begin(), v.begin() + a, 0.0) / a;

    while(!cnt.empty()){
        int x = cnt.rbegin()->second;
        if(x > a)
            break;
        a -= x;
        b = a;
        cnt.erase(--cnt.end());
    }

    int x = 0;
    if(!cnt.empty())
        x = cnt.rbegin()->second;
    long long ans2 = 0;
    for(int i=a; i<=min(x,b); ++i)
        ans2 += combination(x, i);

    cout.setf(ios_base::fixed, ios_base::floatfield);
    cout << setprecision(10);
    cout << ans1 << endl << ans2 << endl;

    return 0;
}

Submission Info

Judge Result