Submission #1515511

---

Source Code Expand

#include <stdio.h>

void bsort(int a[], int n)
{
    int i, j;

    for(i=0;i<n-1;i++){
        for(j=n-1;j>i;j--){
            if(a[j-1]>a[j]){
                int temp=a[j];
                a[j]=a[j-1];
                a[j-1]=temp;
            }
        }
    }
}

int main(void)
{
    int n, k;
    scanf("%d %d", &n, &k);
    int i;
    int l[n];
    for(i=0;i<n;i++)
        scanf("%d", &l[i]);

    bsort(l, n);
    int sum = 0;
    for(i=1;i<=k;i++){
        sum +=l[n-i];
    }
    
    printf("%d\n", sum);
    return 0;
}

Submission Info

Judge Result