bzoj4443 [Scoi2015]小凸玩矩阵

#include<bits/stdc++.h>
#define rep(i,k,n) for(int i=k;i<=(n);i++)
using namespace std;
const int N=251;
int a

,n,m,k,pei
,vis
;
bool dfs(int x,int op){
rep(i,1,m)if(a[x][i]<=op && !vis[i]){vis[i]=1;
if(!pei[i] || dfs(pei[i],op)){
pei[i]=x;return true;
}
}
return false;
}
bool ok(int op){int cnt=0;memset(pei,0,sizeof(pei));
rep(i,1,n){memset(vis,0,sizeof(vis));
if(dfs(i,op))cnt++;}
return cnt>=n-k+1;
}
int main(){//freopen("in.in","r",stdin);
scanf("%d%d%d",&n,&m,&k);
rep(i,1,n)rep(j,1,m)scanf("%d",&a[i][j]);
int l=1,r=1e+9;
while(l<r){
int mid=(l+r)>>1;
if(ok(mid))r=mid;
else l=mid+1;
}printf("%d",l);
}