OIG XV - lic

// tresc: https://szkopul.edu.pl/problemset/problem/yOvtNVzBXZuw0QkrppTB2MW-/site/?key=statement
// OIG XV (1 etap)

#include <algorithm>
#include <array>
#include <iostream>

constexpr int sizik = 3;

int main() {
    std::ios_base::sync_with_stdio(0);
    std::cout.tie(0);
    std::cin.tie(0);

    std::array<int, sizik> L{};

    for (int i = 0; i < L.size(); i++) {
        std::cin >> L[i];
    }

    std::sort(L.begin(), L.end());

    int p = 0, k = L.size() - 1;

    while (p < k) {
        int s = (p + k) / 2;
        if (L[s] <= 0) {
            p = s + 1;
        } else {
            k = s;
        }
    }

    std::swap(L[0], L[p]);

    for (int i = 0; i < L.size(); i++) {
        std::cout << L[i];
    }

    return 0;
}