{"problem":{"name":"Minimize Ordering","description":{"content":"You are given a string $S$. Find the lexicographically smallest string $S'$ obtained by permuting the characters of $S$. Here, for different two strings $s = s_1 s_2 \\ldots s_n$ and $t = t_1 t_2 \\ldot","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc242_b"},"statements":[{"statement_type":"Markdown","content":"You are given a string $S$. Find the lexicographically smallest string $S'$ obtained by permuting the characters of $S$.\nHere, for different two strings $s = s_1 s_2 \\ldots s_n$ and $t = t_1 t_2 \\ldots t_m$, $s \\lt t$ holds lexicographically when one of the conditions below is satisfied.\n\n*   There is an integer $i\\ (1 \\leq i \\leq \\min(n,m))$ such that $s_i \\lt t_i$ and $s_j=t_j$ for all integers $j\\ (1 \\leq j \\lt i)$.\n*   $s_i = t_i$ for all integers $i\\ (1 \\leq i \\leq \\min(n,m))$, and $n \\lt m$.\n\n## Constraints\n\n*   $S$ is a string of length between $1$ and $2 \\times 10^5$ (inclusive) consisting of lowercase English letters.\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$S$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc242_b","tags":[],"sample_group":[["aba","aab\n\nThree strings can be obtained by permuting `aba`:\n\n*   `aba`\n*   `aab`\n*   `baa`\n\nThe lexicographically smallest among them is `aab`."],["zzzz","zzzz"]],"created_at":"2026-03-03 11:01:14"}}