## Max Flow

View as PDF

Points: 3
Time limit: 2.5s
Memory limit: 64M

Author:
Problem type
##### University of Toronto ACM-ICPC Tryouts 2012

Many computer scientists have nightmares about the daunting task of finding the max flow. Can you handle it?

There are scenarios. In each scenario, there are flows, and the value of the -th flow is - your job is to find the largest of the flow values.

#### Input Specification

Line 1: 1 integer,
For each scenario:
Line 1: 1 integer,
Next lines: 1 integer, , for

#### Output Specification

For each scenario:
Line 1: The largest flow value.

#### Sample Input

2
4
2
5
3
5
1
1

#### Sample Output

5
1

#### Explanation of Sample

In the first scenario, the 4 flows have values of 2, 5, 3, and 5, respectively. The largest of these values is 5.

In the second scenario, the only flow has a value of 1, so the max flow is 1.

## Comments

There are no comments at the moment.