PAT | A1112 Stucked Keyboard

#include <iostream>
#include <string>
#include <vector>
#include <unordered_set>

using namespace std;

unordered_set<char> stuck;
unordered_set<char> imposStuck;
vector<char> s;

int main(){
	int k;
	scanf("%d",&k);
	string str;
	cin>>str;
	int len = str.length();
	for(int i = 0;i < len;i++){
		bool considerAsStuck = true;
		for(int j = 1;j < k;j++){
			if(str[i] != str[i + j]){
				considerAsStuck = false;
				break;
			}
		}
		if(considerAsStuck == true){
			if(stuck.find(str[i]) == stuck.end() && imposStuck.find(str[i]) == imposStuck.end()){
				stuck.insert(str[i]);
				s.push_back(str[i]);
			}
			i = i + k - 1;
		}else{
			if(stuck.find(str[i]) != stuck.end()){
				stuck.erase(stuck.find(str[i]));
				vector<char>::iterator it = s.begin();
				while(*it != str[i])
					it++;
				s.erase(it);
			}
			imposStuck.insert(str[i]);
		}
	}
	for(int j = 0;j < s.size();j++)
		printf("%c",s[j]);
	printf("\n");
	for(int i = 0;i < len;i++){
		if(stuck.find(str[i]) == stuck.end()){ // 这个字符没坏
			printf("%c",str[i]);
		}else{
			printf("%c",str[i]);
			i = i + k - 1;
		}
	}
	system("pause");
	return 0;
}