Amalgram
시간 제한1초메모리 제한1024 MB
두 단어가 주어질 때, 각 알파벳 개수가 두 단어 각각의 개수 이상이면서 길이가 최소인 문자열을 출력한다.
문제
An anagram is any arrangement of the letters of a word in which each letter of the alphabet occurs exactly as many times as in the original. For example, clarinets is an anagram of larcenist.
An amalgram is any arrangement of the letters of two words in which each letter of the alphabet occurs at least as many times as in either of the originals. For example, administration is an amalgram of mantis and raisin, although not the shortest possible because the letter d appears in neither.
Given two words, invent an amalgram for them that contains as few letters as possible.
입력
- One line containing lowercase Latin letters representing the word ().
- One line containing lowercase Latin letters representing the word ().
출력
Output a minimally-long sequence of letters that represents an amalgram of and . If there are multiple answers, you may output any of them. Your answer will be judged as correct if it contains at least all of the letters of and all of the letters of , and there is no other possible answer that could be shorter.