PAT甲级1084，散列

分析：和乙级旧键盘那题一样

#include<bits/stdc++.h>
using namespace std;

int main(){
    string s1,s2;
    cin>>s1>>s2;
    set<char> s;
    for(int i=0;i<s2.size();i++){
        s.insert(toupper(s2[i]));
    }
    for(int i=0;i<s1.size();i++){
        if(s.find(toupper(s1[i]))==s.end())
            printf("%c",toupper(s1[i]));
        s.insert(toupper(s1[i]));
    }
    return 0;
}