CodeForces 616B Dinner with Emma

水题

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;

const int maxn=+;
int a[maxn][maxn];
int n,m;

int main()
{
    scanf("%d%d",&n,&m);
    for(int i=;i<=n;i++)
        for(int j=;j<=m;j++)
            scanf("%d",&a[i][j]);

    int ans=-;

    for(int i=;i<=n;i++)
    {
        int nowMin=0x7fffffff;
        for(int j=;j<=m;j++)
            nowMin=min(nowMin,a[i][j]);
        ans=max(ans,nowMin);
    }
    printf("%d\n",ans);
    return ;
}