Submit Time:2024-04-20 12:57:40

运行 ID: 256648

#include<iostream> #include<string> using namespace std; int n,k,re,t = 1,mini = 11;; int a[252]; bool flag = 0; string s; int main() { cin >> s >> k; n = s.length(); for(int i = 1;i <= n;i++) { a[i] = s[i-1]-48; } re = n-k; for(int i = 1;i <= re;i++) { mini = t; for(int i = t;i <= k+t;i++) { if(a[mini] > a[i]) { mini=i; } } if(a[mini]) { flag = 1; } if(flag) { cout << a[mini]; } k -= mini-t; t = mini+1; } if(flag == 0) cout << 0; return 0; }