求助大佬

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<vector>
#include<queue>
#include<stack>
#define maxa 30000+10
#define FOR(i,x,y) for(i=x;i<=y;++i)
using namespace std;
int a[maxa];
int main(){
    int k,m;
    priority_queue<int,vector<int>,greater<int> > q;
    cin>>k>>m;
    int t = 1;
    q.push(1);
    while(!q.empty()){
        int u = q.top();
        q.pop();
        a[t++]=u;
        if(t==maxa){
            break;
        }
        q.push(2*u+1);
        q.push(4*u+5);
    }  
    string s;
    int i;
    stack<int > st;
    FOR(i,1,k){
        cout<<a[i];
        while(a[i]>0){
            st.push(a[i]%10);
            a[i]/=10;
        } 
        while(!st.empty()){
            s+=st.top()+'0';
            st.pop();
        } 
    }
    cout<<endl;
    int tot = 0;
    while(tot<m){
        for(i=0;i<s.length();++i){
            if((i+1)<s.length()&&s[i]<s[i+1]){
                s.erase(i,1);
                break;
            }
            if(i==s.length()){
                s.erase(s.length()-1,1);
            }
            tot++;
        }
    }
    if(s.length()){
        cout<<s<<endl;
    }
    else{
        cout<<0<<endl;
    }
}