1280.cpp

杭电 acm部分代码 有兴趣的可以下载 谢谢

#include<iostream>
#include<vector>
#include<queue>
using namespace std;
void main()
{
    priority_queue<int,vector<int> > intMluti;
    int n ,m;
    int *row;
    while(cin>>n>>m){
        row =  new int [n];
        for(int i = 0;i < n;i++)
            cin>>row[i];
        for(int i = 1;i < n;i++)
            for(int j = 0;j < i;j++)
                intMluti.push(row[i]+row[j]);
        for(int count = 0; count<m ; count++){
            if(!count)
                cout<<intMluti.top();
            else
                cout<<" "<<intMluti.top();
            intMluti.pop();
        }
        cout<<endl;
        delete [] row;
    }
}