#include <cstdio> #include <iostream> #include <vector> #include <queue> #include <algorithm> using namespace std; int main(void) { int n, m; vector<int >int_vec; priority_queue<int >int_pri; while(cin >> n >> m) { int_vec.clear(); int temp = 0, i, j; for(i = 0; i< n ;i++) { cin >> temp; int_vec.push_back(temp); for(j = 0;j < i; j++) { //int_pri.push(int_vec[i] + int_vec[j]); int_pri.push(temp + int_vec[j]); } } for(i = 0; i < m-1; i++) { cout << int_pri.top() << " "; int_pri.pop(); } cout << int_pri.top(); cout << endl; } return 0; }
