zoukankan      html  css  js  c++  java
  • codeforces616B

    Dinner with Emma

     CodeForces - 616B 

    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.

    Examples

    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.

    sol:n*m模拟,这也太水了吧

    #include <bits/stdc++.h>
    using namespace std;
    typedef int ll;
    inline ll read()
    {
        ll s=0;
        bool f=0;
        char ch=' ';
        while(!isdigit(ch))
        {
            f|=(ch=='-'); ch=getchar();
        }
        while(isdigit(ch))
        {
            s=(s<<3)+(s<<1)+(ch^48); ch=getchar();
        }
        return (f)?(-s):(s);
    }
    #define R(x) x=read()
    inline void write(ll x)
    {
        if(x<0)
        {
            putchar('-'); x=-x;
        }
        if(x<10)
        {
            putchar(x+'0'); return;
        }
        write(x/10);
        putchar((x%10)+'0');
        return;
    }
    #define W(x) write(x),putchar(' ')
    #define Wl(x) write(x),putchar('
    ')
    const int inf=0x3f3f3f3f;
    int n,m;
    int main()
    {
        int i,j,ans=-inf;
        R(n); R(m);
        for(i=1;i<=n;i++)
        {
            int tmp=inf;
            for(j=1;j<=m;j++) tmp=min(tmp,read());
            ans=max(ans,tmp);
        }
        Wl(ans);
        return 0;
    }
    /*
    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
    */
    View Code
  • 相关阅读:
    win7用VMware安装CentOs7搭建Linux环境
    安装Vmware并破解
    Webpack打包
    jquery获取动态table列表的值并组装成数组返回
    微信、钉钉、浏览器上H5页面头部标题(title)的修改,不刷新问题
    帮你彻底搞懂JS中的prototype、__proto__与constructor(图解)
    mysql常用语句
    JQuery日期插件
    系统激活教程及文件
    git教程
  • 原文地址:https://www.cnblogs.com/gaojunonly1/p/10657331.html
Copyright © 2011-2022 走看看