codeforces 616B Dinner with Emma
2016-01-12 17:01
302 查看
B. Dinner with Emma
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 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.
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 test(s)
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
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<cstdio> #include<cstring> #include<stack> #include<iterator> #include<vector> #include<iostream> #include<map> #include<string> #include<algorithm> using namespace std; typedef long long ll; typedef unsigned long long ull; //int c[105][105]; const int INF=0x3f3f3f3f; int main() { int n,m; scanf("%d%d",&n,&m); int ans=0; for(int i=0;i<n;i++) { int tt=INF,c; for(int j=0;j<m;j++) scanf("%d",&c),tt=min(c,tt); ans=max(tt,ans); } printf("%d\n",ans); }
相关文章推荐
- 多个TextView实现跑马灯效果
- 处理各大浏览器的<input type="file">显示风格迥异的问题
- loardrunner开启缓存
- loardrunner开启缓存
- RUNTIME
- Android,iOS打开手机QQ与指定用户聊天界面
- 向 COM 公开 .NET Framework 组件
- 三级界面跳转到一级界面的方法
- 使用 Android Studio 生成jar包
- 命令行下执行php脚本
- 图像的点运算
- linux下gdal的python包的安装
- jconsole监控远程linux tomcat运行情况的配置 (转)
- float,double等精度丢失问题
- iOS 类别和扩展(Categories和Extensions)
- java 异常
- 进程守护
- mongodb索引
- struts2常用标签
- linux下Rtree的安装