Anagrammatic Distance#1080
Two words are said to be anagrams of each other if the letters from one word can be rearranged to form the other. For example, occurs is an anagram of succor; however, dear is not an anagram of dared (because d appears twice in dared, but only once in dear). The most famous English anagram is the pair dog and god.
The anagrammatic distance between two words is the minimum number of letters that must be removed so that the remaining portions of the two words become anagrams. For example, given the words sleep and leap, you must remove at least three letters—two from sleep and one from leap—so that the remaining words (lep) are anagrams. For dog and cat, which share no common letters, the anagrammatic distance is , since all letters must be removed. (Any word, including the empty string, is an anagram of itself.)
You must determine the anagrammatic distance for each given pair of words.
The first line contains a positive integer (1 \leq N \leq 60000)—the number of test cases. Each test case consists of two words, possibly empty, each on its own line (for a total of following lines).
All words, if non-empty, consist of lowercase letters of the English alphabet (abcdefghijklmnopqrstuvwxyz). The longest word is pneumonoultramicroscopicsilicovolcanoconiosis.
For each test case, print the case number and the anagrammatic distance, formatted as shown in the output example.
Example 1