提交时间:2024-03-02 08:33:49

运行 ID: 133611

#include <bits/stdc++.h> using namespace std; char a[100005]; int main() { string s; cin >> s; int t; cin >> t; memset(a, -1, sizeof a); int len = s.size(); for (int i = 1; i <= s.size(); i++) { a[i] = s[i-1]; } for (int i = 1; i <= t; i++) { int maxx = -1e9, maxp = 0; for (int j = 1; j < len; j++) { if ((a[j] - a[j+1]) > maxx) { maxx = a[j] - a[j+1]; maxp = j; } } len--; for (int j = maxp; j <= len; j++) { a[j] = a[j+1]; } } for (int i = 1; i <= len; i++) { cout << a[i]; } }