「1050」String Subtraction

Given two strings S1​ and S2​, S=S1​−S2​ is defined to be the remaining string after taking all the characters in S2​ from S1​. Your task is simply to calculate S1​−S2​ for any given strings. However, it might not be that simple to do it fast.

Input Specification:

Each input file contains one test case. Each case consists of two lines which gives S1​ and S2​, respectively. The string lengths of both strings are no more than 104. It is guaranteed that all the characters are visible ASCII codes and white space, and a new line character signals the end of a string.

Output Specification:

For each test case, print S1​−S2​ in one line.

Sample Input:

They are students.
aeiou

Sample Output:

Thy r stdnts.

---

Ω

将S2中字符从S1中去除，100ms时间限制。

用map<char,bool> flag记录S2中所有字符，然后遍历S1输出，只有flag[c]=false的字符才能输出。

---

🐎

#include <iostream>
#include <map>

using namespace std;

int main()
{
    string s1, s2;
    getline(cin, s1);
    map<char, bool> flag;
    getline(cin, s2);
    for (auto &c: s2)
        flag[c] = true;
    for (auto &c: s1)
        if (!flag[c])
            cout << c;
}