Submission #1182247


Source Code Expand

#include <cstdio>
#include <algorithm>
#include <cstring>
#include <iostream>

using namespace std;

const int maxn = 55;

long long a[maxn];
long long c[maxn][maxn];

void init(){
    c[0][0] = 1;
    for(int i = 1;i <= 50;i++){
        c[i][0] = 1;
        c[i][i] = 1;
        for(int j = 1;j < i;j++){
            c[i][j] = c[i - 1][j] + c[i - 1][j - 1];
        }
    }
}

int main(){
    init();
    int n;
    int A,B;
    scanf("%d%d%d",&n,&A,&B);
    for(int i = 1;i <= n;i++){
        cin >> a[i];    }
    sort(a + 1,a + 1 + n);
    long long sum = 0;
    for(int i = 0;i < A;i++){
        sum += a[n - i];
    }
    double ans = sum / (1.0 * A);
    printf("%.10lf\n",ans);
    if(sum == a[n] * A){
        int num = 0;
        for(int i = 1;i <= n;i++){
            if(a[i] == a[n]) num++;
        }
        long long ans = 0;
        for(int i = A;i <= min(num,B);i++){
            ans += c[num][i];
        }
        cout << ans << endl;
    }else{
        int num = 0;
        int num1 = 0;
        for(int i = n - A + 1;i <= n;i++){
            if(a[i] == a[n - A + 1]){
                num1++;
            }
        }
        for(int i = 1;i <= n;i++){
            if(a[i] == a[n - A + 1]){
                num++;
            }
        }
        cout << c[num][num1] << endl;
    }
    return 0;
}

Submission Info

Submission Time
Task D - Maximum Average Sets
User CrazyArcher
Language C++14 (GCC 5.4.1)
Score 400
Code Size 1378 Byte
Status AC
Exec Time 1 ms
Memory 256 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:28:29: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d%d",&n,&A,&B);
                             ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 400 / 400
Status
AC × 4
AC × 19
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt
All sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, subtask_1_1.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_2.txt, subtask_1_3.txt, subtask_1_4.txt, subtask_1_5.txt, subtask_1_6.txt, subtask_1_7.txt, subtask_1_8.txt, subtask_1_9.txt
Case Name Status Exec Time Memory
sample_01.txt AC 1 ms 256 KB
sample_02.txt AC 1 ms 256 KB
sample_03.txt AC 1 ms 256 KB
sample_04.txt AC 1 ms 256 KB
subtask_1_1.txt AC 1 ms 256 KB
subtask_1_10.txt AC 1 ms 256 KB
subtask_1_11.txt AC 1 ms 256 KB
subtask_1_12.txt AC 1 ms 256 KB
subtask_1_13.txt AC 1 ms 256 KB
subtask_1_14.txt AC 1 ms 256 KB
subtask_1_15.txt AC 1 ms 256 KB
subtask_1_2.txt AC 1 ms 256 KB
subtask_1_3.txt AC 1 ms 256 KB
subtask_1_4.txt AC 1 ms 256 KB
subtask_1_5.txt AC 1 ms 256 KB
subtask_1_6.txt AC 1 ms 256 KB
subtask_1_7.txt AC 1 ms 256 KB
subtask_1_8.txt AC 1 ms 256 KB
subtask_1_9.txt AC 1 ms 256 KB