CT25203

Porter and the Lowest Reading

EasyL3 · Syntax SurferAcceptance: 0.0%XP: 20

Porter the reckoner watches over the copper works of Verdigris's stores of crates. A careful computation stands between order and chaos. 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 <= 856; 0 <= a[i] <= 1000000; answers fit a signed 64-bit integer.

Example 1:

Input: 413 758743 349342 90922 491338 444224 995841 463774 6037 273211 258700 845537 541877 88054 345616 519813 69912 142825 288358 90652 218946 766560 530676 902512 71372 687847 935884 415295 43016 346129 128712 52372 761985 692274 488371 233368 936331 968075 668368 228590 150249 782814 315121 673406 630002 7571 360276 501909 70983 726135 545302 353221 498123 589738 475139 469853 341415 719027 287095 781413 520167 652209 456590 697808 983266 768501 666850 988767 396801 375797 45859 911819 357138 821857 610995 511746 857687 640927 405440 503921 970193 52944 586569 854565 353411 741049 513385 954855 241834 102862 151404 882789 819119 806508 960852 335213 385786 260396 591924 253022 687130 232420 729620 443994 101435 115856 215193 127220 249239 700167 326734 908914 390897 858617 413075 733462 83291…
Output: 778

Example 2:

Input: 198 785537 817504 817085 445740 751974 625270 714919 331479 303341 345070 687826 575054 651629 82704 29775 526356 579649 808488 108931 623175 504280 920036 933039 527800 296844 474854 348321 726987 120370 122715 643446 187154 384212 525502 99434 727595 741604 185143 385696 633225 992315 155517 917358 957585 323657 890705 222042 725445 684815 56026 219595 948405 984818 457737 206932 79055 655175 915274 657640 499838 434235 397604 962404 591717 418891 137856 441763 863962 453596 131400 403457 154444 967248 945941 497143 731945 744407 301087 209404 231592 390435 215608 642316 105208 972694 382640 590588 376274 899754 922102 418335 415003 91819 974895 647055 268756 391725 796193 416929 199587 774608 145763 784617 897734 448602 783232 507233 368943 717438 684470 902266 65850 329380 425211 16710…
Output: 3350

Example 3:

Input: 299 479892 154264 406569 376011 988418 415715 811603 886449 4912 517131 239059 210128 812271 97548 513937 709431 317526 730019 9025 299387 444977 892237 960886 445049 415580 133783 78415 920907 692724 634840 850139 761757 746367 102108 900841 125866 218720 214823 888793 138758 863678 147975 814019 604447 58019 454692 782730 682223 539784 841521 525929 585714 961643 49380 943380 307508 141447 635085 701135 406637 342370 59032 958740 330505 156302 909732 997659 865456 983609 727197 196947 968965 36994 401948 688356 49151 19305 313656 588657 871866 55774 9347 905890 198608 204917 389520 821074 920055 391973 187657 808989 288037 964796 761592 9851 832056 993491 932085 873195 898473 762861 868132 352757 575932 504216 475526 44732 441577 661162 397839 496668 808099 131100 931334 359885 744865 56…
Output: 4912

Constraints:

1 <= n <= 856; 0 <= a[i] <= 1000000; answers fit a signed 64-bit integer.

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