problem - 616B -codeforces

最新推荐文章于 2022-04-27 23:47:09 发布

叶灯

最新推荐文章于 2022-04-27 23:47:09 发布

阅读量439

点赞数

CC 4.0 BY-SA版权

分类专栏： codeforces 文章标签：渣渣的奋斗积少成多

本文链接：https://blog.youkuaiyun.com/yedengmei/article/details/50544298

codeforces 专栏收录该内容

3 篇文章

订阅专栏

本文介绍了一道算法题目，讲述了Jack和Emma如何通过各自的最优选择来决定在城市网格中的晚餐地点。文章提供了完整的代码实现及解析。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

点击打开链接

B. Dinner with Emma

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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

1

分析：该题讲的是Jack 和 Emma出去吃饭，jack想便宜，Emma想吃贵的，综合两个，由Emma选择去那条横街道，jack决定去竖街道。
综上，可以说是找每行的最小值存起来，然后找出这些最小值的最大值。

代码实现：
#include<iostream>
#include<cstdio>
#define X 0x7fffffff
using namespace std;
int main()
{
    int n,m;
    __int64 a,s1,s2;
    while(scanf("%d %d",&n,&m) != EOF)
    {
        int i,j;
        __int64 a;
        s1 = -X;
        for(i = 0;i < n;i++)
        {
            s2 = X;
            for(j = 0;j < m;j++)
            {
                scanf("%I64d",&a);
                if(s2 > a)
                    s2 = a;
            }
            s1 = max(s1,s2);
        }
        printf("%I64d\n",s1);
    }
    return 0;
}

总结：该题考察的最先是读题能力，然后结合他们两人的特点选出最佳方案。