L2-041 插松枝

 #include <iostream>
#include <deque>
#include <cstring>
using namespace std;
deque<int> qu, st;//ij and box
int n, m, k, ans[1005], idx;
int main(){
    cin>>n>>m>>k;
    while(n --){
        int t;
        cin>>t;
        qu.push_back(t);
    }
    while(!st.empty() || !qu.empty()){
        int cnt = 0, last = 1000;//cnt 当前松针片松针的数量，last 最后一个松针片
        while(cnt < k){
            if(!st.empty() && st.front()<=last){//box中取
                last = st.front();
                ans[idx++] = last;
                st.pop_front();
                cnt ++;
            }else if(!qu.empty() && last >= qu.front()){//injector中取
                last = qu.front();
                ans[idx++] = last;
                qu.pop_front();
                cnt ++;
            }else if(!qu.empty() && st.size() < m){//ijor放入box中
                st.push_front(qu.front());
                qu.pop_front();
            }else break;
        }
        for(int i=0; i<idx; i++){
            if(i != idx-1) cout<<ans[i]<<" ";
            else cout<<ans[i];
        }
        memset(ans, 0, sizeof ans);
        idx = 0;
        cout<<endl;
    }
    return 0;
}