You are given strings s and t, consisting of lowercase English letters. You will create a string s' by freely rearranging the characters in s. You will also create a string t' by freely rearranging the characters in t. Determine whether it is possible to satisfy s' < t' for the lexicographic order.
import numpy as np
from collections import Counter
import collections
round = lambda x:(x*2+1)//2
a = input()
b = input()
a = list(a)
b = list(b)
b = sorted(b,reverse = True)
a = sorted(a)
a = str(a)
b = str(b)
if a >  b :
  print("Yes")
else:
  print("No")
import numpy as np
from collections import Counter
import collections
round = lambda x:(x*2+1)//2
a = input()
b = input()
a = list(a)
b = list(b)
b = sorted(b,reverse = True)
a = sorted(a)
#a = a[1:]
a = "".join(a)
b = "".join(b)
if a <  b :
  print("Yes")
else:
  print("No")