7-101 3008 前m大的数

#include <algorithm>
#include <cstdint>
#include <iostream>
#include <limits>
#include <numeric>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>

using i32 = std::int32_t;
using i64 = std::int64_t;
using u32 = std::uint32_t;
using u64 = std::uint64_t;
using pii = std::pair<i32, i32>;
using pll = std::pair<i64, i64>;
using vi = std::vector<i32>;
using vll = std::vector<i64>;
using vpii = std::vector<pii>;
using vpll = std::vector<pll>;

void solve();

int main()
{
    std::cin.tie(nullptr)->sync_with_stdio(false);
    solve();
}

void solve()
{
    i32 n, m;
    bool endl = false;
    while (std::cin >> n >> m)
    {
        if (endl)
        {
            std::cout << std::endl;
        }
        vi array(n);
        for (auto &item : array)
        {
            std::cin >> item;
        }
        vi new_array;
        for (i32 i = 0; i < n; ++i)
        {
            for (i32 j = i + 1; j < n; ++j)
            {
                new_array.emplace_back(array[i] + array[j]);
            }
        }
        std::sort(new_array.begin(), new_array.end(), [](auto a, auto b) { return a > b; });
        bool space = false;
        for (int i = 0; i < m; ++i)
        {
            if(space){
                std::cout << ' ';
            }
            std::cout << new_array[i];
            space = true;
        }
        endl = true;
    }
}