hdu 1280 前m大的数

AC代码：

#include<cstdio>
#include<algorithm>
using namespace std;
int a[3005], b[4500000];
bool cmp(int a, int b){   //由大到小排列
    return a > b;
}
int main(){
    int n, m;
    while(scanf("%d %d", &n, &m) != EOF){
        for(int i = 0; i < n; i++)
            scanf("%d", &a[i]);
        int k = 0;
        for(int i = 0; i < n; i++)
            for(int j = i + 1; j < n; j++)
                b[k++] = a[i] + a[j];
        sort(b, b + n, cmp);
        for(int i = 0; i < m; i++){
            if(i == 0)
                printf("%d", b[i]);
            else
                printf(" %d", b[i]);    
        }
        printf("\n");   
    }
    return 0;
}