сшка ошоп 2 тур

#include <iostream>
#include <string>
#include <sstream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <memory.h>
#include <stdio.h>
#include <stack>
#include <deque>
#include <queue>
#include <set>
#include <iterator>
#include <map>
#include <iomanip>
#include <unordered_set>
#define int long long
#define pb push_back
#define double long double
#define endl "\n"
#define un unsigned
#define INF 1000000000009
#define pii pair<int, int>
#define all(v) v.begin(), v.end()
using namespace std;

const int N = 100000;

int to_int(string s, int j, vector<int> &used, int skip)
{
    int ans = 0;

    int i = -1;
    int k = 0;

    while (k < j)
    {
        i++;

        if (used[i] || skip == i)
        {
            continue;
        }

        ans = ans * 10 +  (s[i] - '0');
        k++;
    }

    return ans;
}

int to_int_for_b(string s, int j)
{
    int ans = 0;

    for (int i = j; i < s.size(); i++)
    {
        ans = ans * 10 + (s[i] - '0');
    }

    return ans;
}

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

    string a, b;
    cin >> a >> b;

    sort(all(a));

    if (b.size() > a.size())
    {
        for (int i = a.size() - 1; i >= 0; i--)
        {
            cout << a[i];
        }

        return 0;
    }

    int ans = 0;

    vector<int> used(20, 0);

    int fl = 0;

    for (int i = 0; i < a.size(); i++)
    {
        int lol = 0;
        for (int j = a.size() - 1; j >= 0; j--)
        {
            if (used[j])
            {
                continue;
            }

            if (a[j] < b[i])
            {
                ans = ans * 10 + a[j] - '0';
                used[j] = 1;

                if (a[j] < b[i])
                {
                    fl = 1;
                }

                break;
            }

            if (a[j] == b[i] && !fl)
            {
                int kek = to_int(a, a.size() - i - 1, used, j);
                int lol = to_int_for_b(b, i + 1);

                if (kek <= lol)
                {
                    ans = ans * 10 + a[j] - '0';
                    used[j] = 1;

                    if (a[j] < b[i])
                    {
                        fl = 1;
                    }

                    break;
                }
            }

            if (fl)
            {
                used[j] = 1;
                ans = ans * 10 + a[j] - '0';
            }
        }
    }

    cout << ans;
    return 0;
}