This problem introduces popular algorithm of the "linear search", which should be learnt thoroughly as it is often used in programming more complex tasks (sorting etc.)
Very common operation on sequence of values, or arrays is to find its extremal value - maximum or minimum. To achieve this one need to store current maximum (or minimum respectively) in a separate variable, and then run through array, comparing each of its elements to this variable. Whenever next value is greater than this temporary variable, this value should be copied into it (as a new maximum).
At the end of the pass this temporary variable will hold the extremum value.
Input data will give you exactly 300 numbers in a single line.
Answer should contain maximum and minimum of these values, separated by space.
Important: at this problem some people ask "How should I copy so many numbers at my
code and put commas between, as I create array / list of them..."
Please, don't do this! Instead watch my demo video
(from about 4:00) to see how we use
standard input to read numbers when running on-site!
Example:
input data:
1 3 5 7 9 11 ... 295 297 299 300 298 296 ... 12 10 8 6 4 2
answer:
300 1