<p>You are given a string <code>num</code> representing <strong>the digits</strong> of a very large integer and an integer <code>k</code>. You are allowed to swap any two adjacent digits of the integer <strong>at most</strong> <code>k</code> times.</p>

<p>Return <em>the minimum integer you can obtain also as a string</em>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2020/06/17/q4_1.jpg" style="width: 500px; height: 40px;" />
<pre>
<strong>Input:</strong> num = &quot;4321&quot;, k = 4
<strong>Output:</strong> &quot;1342&quot;
<strong>Explanation:</strong> The steps to obtain the minimum integer from 4321 with 4 adjacent swaps are shown.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> num = &quot;100&quot;, k = 1
<strong>Output:</strong> &quot;010&quot;
<strong>Explanation:</strong> It&#39;s ok for the output to have leading zeros, but the input is guaranteed not to have any leading zeros.
</pre>

<p><strong class="example">Example 3:</strong></p>

<pre>
<strong>Input:</strong> num = &quot;36789&quot;, k = 1000
<strong>Output:</strong> &quot;36789&quot;
<strong>Explanation:</strong> We can keep the number without any swaps.
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= num.length &lt;= 3 * 10<sup>4</sup></code></li>
	<li><code>num</code> consists of only <strong>digits</strong> and does not contain <strong>leading zeros</strong>.</li>
	<li><code>1 &lt;= k &lt;= 10<sup>9</sup></code></li>
</ul>

class Solution {
public:
    string minInteger(string s, int k) {
        int n=s.size();
        vector<int> prefix(n,0),prefix1(n,0),visited(n,0);
        string ans="";
        int cnt;
        bool tp=false;
        int current=n;
        for(int i=0;i<9;i++){
            cnt=0;
        for(int j=0;j<n;j++){
            if(current<j)break;
            if(s[j]==(i+'0')){
                if((j-prefix1[j]-cnt)<=k){
                prefix[j]++;
                // cout<<prefix1[j]<<" "<<i<<" "<<cnt<<endl;
                k-=(j-prefix1[j]-cnt);
                ans+=s[j];
                visited[j]=1;
                cnt++;
                // cout<<k<<" "<<i<<endl;
                }
                else{
                    // tp=true;
                    current=j;
                    break;
                }
                // else{

                // }
            }
        }
        // if(tp)break;
            prefix1=prefix;
            for(int j=1;j<n;j++){
                prefix1[j]+=prefix1[j-1];
            }
        }
        cout<<k<<" ";
        for(int i=0;i<n;i++){
           if(!visited[i]){
               ans+=s[i];
           }
        }
        cout<<ans<<endl;
        for(int i=0;i<n-1;i++){
            if(ans[i]>ans[i+1]){
                current=i+1;
                break;
            }
        }
        // cout<<current<<" ";
        while(current!=n && current>0 && k>0){
            swap(ans[current],ans[current-1]);
            current--;
            k--;
        }
        return ans;
        
    }
};
11900