#include <algorithm>
#include <vector>
#include <iostream>

int main()
{
    std::cout << "Enter n: ";

    unsigned n { };
    std::cin >> n;

    std::vector<int> points { };
    std::cout << "Enter points: ";

    int point { };
    for (unsigned i { 0 }; i < n; ++i)
    {
        std::cin >> point;
        points.push_back(point);
    }

    std::cout << "Enter k: ";

    unsigned k { 0 };
    std::cin >> k;

    if (k > points.size())
    {
        std::cout << "No solution is possible." << std::endl;
        return 1;
    }

    int max_distance { 0 };
    std::vector<int> solution { };

    // Skriv din kod här

    std::cout << "The largest minimum distance is " << max_distance << std::endl
              << "One possible sequence: ";

    for (int point : solution)
        std::cout << point << " ";
    std::cout << std::endl;
}