codeforces-scrape

Codeforces scraped problems and editorials
git clone git://git.laack.co/codeforces-scrape.git
Log | Files | Refs | README

616B.md (2020B)


      1 Source: https://codeforces.com/problemset/problem/616/B
      2 
      3 B. Dinner with Emma
      4 
      5 time limit per test
      6 
      7 1 second
      8 
      9 memory limit per test
     10 
     11 256 megabytes
     12 
     13 input
     14 
     15 standard input
     16 
     17 output
     18 
     19 standard output
     20 
     21 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.
     22 
     23 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*.
     24 
     25 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.
     26 
     27 Input
     28 
     29 The first line contains two integers *n*, *m* (1 ≤ *n*, *m* ≤ 100) — the number of streets and avenues in Munhattan.
     30 
     31 Each of the next *n* lines contains *m* integers *c**ij* (1 ≤ *c**ij* ≤ 109) — the cost of the dinner in the restaurant on the intersection of the *i*-th street and the *j*-th avenue.
     32 
     33 Output
     34 
     35 Print the only integer *a* — the cost of the dinner for Jack and Emma.
     36 
     37 Examples
     38 
     39 Input
     40 
     41 ```
     42 3 4  
     43 4 1 3 5  
     44 2 2 2 2  
     45 5 4 5 1
     46 ```
     47 
     48 Output
     49 
     50 ```
     51 2
     52 ```
     53 
     54 Input
     55 
     56 ```
     57 3 3  
     58 1 2 3  
     59 2 3 1  
     60 3 1 2
     61 ```
     62 
     63 Output
     64 
     65 ```
     66 1
     67 ```
     68 
     69 Note
     70 
     71 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.
     72 
     73 In the second example regardless of Emma's choice Jack can choose a restaurant with the cost of the dinner 1.