tmp2.cpp

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;

// Function to find the smallest permutation for the track number
int smallestPermutation(int num) {
    string s = to_string(abs(num));
    vector<char> digits(s.begin(), s.end());

    if (num < 0) {
        // Negative number: largest permutation, as negative sign makes it smallest
        sort(digits.rbegin(), digits.rend());
        string result = "";
        for (char d : digits) result += d;
        return -stoi(result);
    } else {
        // Positive number: smallest permutation, no leading zero
        sort(digits.begin(), digits.end());
        // Move leading zero(s) behind first non-zero
        if (digits[0] == '0') {
            for (int i = 1; i < digits.size(); ++i) {
                if (digits[i] != '0') {
                    swap(digits[0], digits[i]);
                    break;
                }
            }
        }
        string result = "";
        for (char d : digits) result += d;
        return stoi(result);
    }
}

int main() {
    int num;
    cin >> num;
    cout << smallestPermutation(num) << endl;
    return 0;
}