Educational Codeforces Round 5

最新推荐文章于 2017-10-28 10:21:37 发布

原创最新推荐文章于 2017-10-28 10:21:37 发布 · 240 阅读

0 ·

CC 4.0 BY-SA版权

code 专栏收录该内容

3 篇文章

订阅专栏

在一个由街道和大道组成的网格中，每条街与大道交汇处有一家餐厅。主人公杰克和艾玛将通过一种特殊的方式选择一家餐厅共进晚餐：艾玛先选街道，杰克再从该街道上选择他认为最经济的餐厅。此过程体现了两人的最优选择策略。

Jack decides to invite Emma out for a dinner. Jack is a modest student, he doesn't want to go to an expensive restaurant. Emma is a girl with high taste, she prefers elite places.

Munhattan consists of n streets and m avenues. There is exactly one restaurant on the intersection of each street and avenue. The streets are numbered with integers from 1 to n and the avenues are numbered with integers from 1 to m. The cost of dinner in the restaurant at the intersection of the i-th street and the j-th avenue is c_ij.

Jack and Emma decide to choose the restaurant in the following way. Firstly Emma chooses the street to dinner and then Jack chooses the avenue. Emma and Jack makes their choice optimally: Emma wants to maximize the cost of the dinner, Jack wants to minimize it. Emma takes into account that Jack wants to minimize the cost of the dinner. Find the cost of the dinner for the couple in love.

Input

The first line contains two integers n, m (1 ≤ n, m ≤ 100) — the number of streets and avenues in Munhattan.

Each of the next n lines contains m integers c_ij (1 ≤ c_ij ≤ 10⁹) — the cost of the dinner in the restaurant on the intersection of the i-th street and the j-th avenue.

Output

Print the only integer a — the cost of the dinner for Jack and Emma.

Sample test(s)

Input

Output

Input

Output

Note

In the first example if Emma chooses the first or the third streets Jack can choose an avenue with the cost of the dinner 1. So she chooses the second street and Jack chooses any avenue. The cost of the dinner is 2.

In the second example regardless of Emma's choice Jack can choose a restaurant with the cost of the dinner 1.

#include <bits/stdc++.h>

using namespace std;

#define chfor(ch,cha,chn) for(char ch=cha;ch<chn;ch++)
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define fi first
#define se second 
#define M 1000000  
typedef long long ll;
const int shi=123;             
 

int main(void){  
     int n,m;
     cin >> n >> m;
   int a[n][m];
   for(int i =0;i<n;i++)
     for(int j=0;j<m;j++)
           cin >> a[i][j]; 
   int b[n],k=0;
   
   for(int i=0;i<n;i++)
{
    b[i]=a[i][0];
    for (int j=0;j<m;j++)
       if(b[i]>a[i][j])
            b[i]=a[i][j];
}
k=b[0];
   for(int i=0;i<n;i++)
          if(k<b[i]) 
               k=b[i];
 cout << k << endl; 

      return 0;  
}