CT403

Petr's tickets Lowest Reading

EasyL2 · Byte BanditAcceptance: 0.0%XP: 10

The harbor bell rings at the crane marshes of Stillwater; Petr weighs the day's tickets manifests and starts the calculations. Task: Read n integers and print the smallest value. Input format: First line: n. Second line: n space-separated integers. Output format: Print the minimum value. Constraints: 1 <= n <= 91; -100 <= a[i] <= 1000000000; answers fit a signed 64-bit integer.

Example 1:

Input: 8 403543047 767538478 294617146 533818832 871900571 899074100 439717344 156629225
Output: 156629225

Example 2:

Input: 5 404630471 35107551 298714094 231928407 918196538
Output: 35107551

Example 3:

Input: 34 320154691 338391378 493971149 297217887 983830521 160414080 259535207 425889463 949961219 871225979 200235683 339826803 865733419 972057734 736947007 384748222 560842225 23110533 13858154 955452166 603726588 363802266 953431769 23878302 802054411 486775801 704288658 560630121 157768841 32291097 462238058 697209157 908303690 598239042
Output: 13858154

Constraints:

1 <= n <= 91; -100 <= a[i] <= 1000000000; answers fit a signed 64-bit integer.

Loading...
Test Cases:No test cases
No test cases available.