标签：
Time Limit: 20 Sec
Memory Limit: 256 MB
codeforces.com/problemset/problem/91/B
Input
The first line contains an integer k (1 ≤ k ≤ 2000). The second line contains a non-empty string s, consisting of lowercase Latin letters, at most 100 characters long. The third line contains an integer n (0 ≤ n ≤ 20000) — the number of username changes. Each of the next n lines contains the actual changes, one per line. The changes are written as "pi ci" (without the quotes), where pi (1 ≤ pi ≤ 200000) is the number of occurrences of letter ci, ci is a lowercase Latin letter. It is guaranteed that the operations are correct, that is, the letter to be deleted always exists, and after all operations not all letters are deleted from the name. The letters‘ occurrences are numbered starting from 1.
Output
Print a single string — the user‘s final name after all changes are applied to it.
Sample Input
2
bac
3
2 a
1 b
2 c
Sample Output
acb
题意
题解：
代码
//qscqesze #include <cstdio> #include <cmath> #include <cstring> #include <ctime> #include <iostream> #include <algorithm> #include <set> #include <vector> #include <sstream> #include <queue> #include <typeinfo> #include <fstream> #include <map> #include <stack> typedef long long ll; using namespace std; //freopen("D.in","r",stdin); //freopen("D.out","w",stdout); #define sspeed ios_base::sync_with_stdio(0);cin.tie(0) #define maxn 2000001 #define mod 1000000007 #define eps 1e-9 int Num; char CH[20]; const int inf=0x3f3f3f3f; inline ll read() { int x=0,f=1;char ch=getchar(); while(ch<‘0‘||ch>‘9‘){if(ch==‘-‘)f=-1;ch=getchar();} while(ch>=‘0‘&&ch<=‘9‘){x=x*10+ch-‘0‘;ch=getchar();} return x*f; } //************************************************************************************** int check[maxn]; vector<int> kiss[30]; string os,s; int main() { int k=read(); cin>>os; for(int i=0;i<k;i++) s+=os; for(int i=0;i<s.size();i++) kiss[s[i]-‘a‘].push_back(i); int n=read(); for(int i=0;i<n;i++) { int a; char b; cin>>a>>b; check[kiss[b-‘a‘][a-1]]=1; kiss[b-‘a‘].erase(kiss[b-‘a‘].begin()+a-1); } for(int i=0;i<s.size();i++) if(!check[i]) cout<<s[i]; }
VK Cup 2012 Qualification Round 2 C. String Manipulation 1.0 字符串模拟
标签：
原文地址：http://www.cnblogs.com/qscqesze/p/4604502.html
