CodeForces

#include <iostream>#include <cstdio>#include <string>#include <cstring>#include <algorithm>#include <cmath>#include <queue>#include <vector>#include <set>#include <stack>#include <map>#include <climits>using namespace std;typedef long long ll;const int maxn = 100 + 7, INF = 0x3f3f3f3f, mod = 1e9 + 7;int n, m;int a[maxn];int main() {    scanf("%d %d", &n, &m);    int ans = 0;    for(int i = 0; i < n; ++i) {        int min_ = INF;        for(int i = 0; i < m; ++i) {            int x;            scanf("%d", &x);            min_ = min(min_, x);        }        ans = max(ans, min_);    }    printf("%d\n", ans);    return 0;}