20pts AC#2#3 萌新求调qwq

#include <iostream>
#include <algorithm>
using namespace std;
const int N=805;
const int M=805;
const int inf=0x3f3f3f3f;
int n,m,k,l;
char eat[N][M];
int nxt[N][M];
struct rabbit {
    int day,id;
} temp[N],temp2[N],nowset[N];
bool cmp(rabbit a,rabbit b) {
    return a.day>b.day;
}
bool selected[N];
int ans[N][N];
void print(int ind) {
	int cur=0;
    for(int i=1;i<=n;i++) {
        if(selected[i]) ans[ind][++cur]=i;
    }
}
int main() {
    cin>>n>>m>>k>>l;
    for(int i=1;i<=n;i++)
        for(int j=1;j<=m;j++)
            cin>>eat[i][j];
    for(int i=1;i<=n;i++) {
        nxt[i][m+1]=inf;
        for(int j=m;j>=1;j--) {
            if(eat[i][j]=='0') nxt[i][j]=0;
            else if(nxt[i][j+1]==inf) nxt[i][j]=inf;
            else nxt[i][j]=nxt[i][j+1]+1;
        }
    }
    for(int i=1;i<=n;i++) {
        temp[i]=rabbit{nxt[i][1],i};
    }
    sort(temp+1,temp+n+1,cmp);
    for(int i=1;i<=k;i++) {
        selected[temp[i].id]=1;
    }
    print();
    for(int i=2;i<=m;i++) {
        int cur=0;
        for(int j=1;j<=n;j++) {
            temp2[j]=rabbit{nxt[j][i],j};
            if(selected[j]) nowset[++cur]=rabbit{nxt[j][i],j};
        }
        sort(temp2+1,temp2+n+1,cmp);
        sort(nowset+1,nowset+n+1,cmp);
        int change=0;
        int K=k;
        for(int j=1;change<l&&j<=k;j++) {
        	//printf("%d %d %d %d\n",selected[temp2[j].id],temp2[j].id,j);
            if(selected[temp2[j].id]) continue;
            if(nxt[temp2[j].id][i]<nxt[nowset[K].id][i]) continue;
            selected[nowset[K--].id]=0;
            selected[temp2[j].id]=1;
            change++;
        }
        for(int j=1;j<=n;j++) {
            if(selected[j]) 
        }
        for(int j=1;j<=n;j++) {
            temp[i]=temp2[i];
        }
        print();
    }
    return 0;
}