题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1280
算法特工队QQ群:979618872 (伸手党绕边,欢迎有良好基础的人加入)
//
// Created by Leo Lee on 2019/4/4.
//
//使用快速排序直接求解即可
#include <iostream>
#include <vector>
#include <algorithm>
#include <vector>
using namespace std;
vector<int> vector1;
vector<int> vecSum;
void Ksort();
bool cmp(int a,int b);
int main(){
int total,k;
while(scanf("%d%d",&total,&k)!=EOF){
vector1.clear();
vecSum.clear();
int tmpin;
for(int i = 0;i<total;i++){
scanf("%d",&tmpin);
vector1.push_back(tmpin);
}
Ksort();
for(int i = 0;i<k;i++){
if(i ==0);
else printf(" ");
printf("%d",vecSum[i]);
}
cout<<endl;
}
return 0;
}
void Ksort(){
for(int i = 0;i<vector1.size()-1;i++){
for(int j=i+1;j<vector1.size();j++){
vecSum.push_back(vector1[i]+vector1[j]);
}
}
sort(vecSum.begin(),vecSum.end(),cmp);
}
bool cmp(int a,int b){
return a>b;
}