CodeForces - 616B Dinner with Emma （模拟）水

CodeForces - 616B Dinner with Emma Time Limit: 1000MS   Memory Limit: 262144KB   64bit IO Format: %I64d & %I64u Submit Status Description 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 cij. 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 cij (1 ≤ cij ≤ 109) — 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 Input Input 3 4 4 1 3 5 2 2 2 2 5 4 5 1 Output 2 Input 3 3 1 2 3 2 3 1 3 1 2 Output 1 Hint 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. Source Educational Codeforces Round 5 //题意：输入n,m;表示有n条街，每条街有m家饭店，每条街都有一家是最便宜的，问这n个最便宜中的最贵的是多少。 #include<stdio.h> #include<string.h> #include<algorithm> #include<iostream> #include<stack> #include<queue> #include<math.h> #define INF 0x3f3f3f3f #define ull unsigned long long #define ll long long #define IN __int64 #define N 100010 #define M 1000000007 using namespace std; int main() { int n,m,i,j; int mi,ma,mm; while(scanf("%d%d",&n,&m)!=EOF) { ma=0; for(i=0;i<n;i++) { mi=INF; for(j=0;j<m;j++) { scanf("%d",&mm); mi=min(mi,mm); } ma=max(ma,mi); } printf("%d\n",ma); } return 0; }