CT25858

Botanist's parcels Lowest Reading

EasyL3 · Syntax SurferAcceptance: 0.0%XP: 20

Before the gates of the archive halls of Scrollkeep close for winter, Botanist must finish the parcels ledger - one figure at a time. 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 <= 753; 0 <= a[i] <= 1000000; answers fit a signed 64-bit integer.

Example 1:

Input: 631 904677 396639 613211 178560 68621 582172 183523 478008 5677 741303 318595 126485 575750 717902 297088 203255 512203 631693 184866 817619 174959 796510 259393 835456 241967 981187 652037 50286 83219 455201 740041 720249 432159 160753 870642 656070 546737 49521 890992 275011 397233 712884 545876 110934 291919 548323 528240 901282 785207 242581 383773 805166 309222 208644 465718 854682 89583 544364 120740 184279 122295 62175 716497 539955 89557 372541 935338 164005 748756 744059 554454 191412 502487 440843 316095 195098 805977 682702 788812 308027 230505 553239 367725 806683 815753 622895 528264 983143 153282 907813 587294 898382 638388 728540 151542 714421 912129 427441 342648 599400 366073 713124 802622 382562 580415 726083 505222 292439 449254 641947 974644 226116 540771 332920 424761 …
Output: 784

Example 2:

Input: 196 513549 327162 773131 807713 930583 511199 680304 910743 785775 346802 689461 734269 479179 259251 768702 810203 570243 461593 716054 116480 335162 902257 43524 433071 971335 566074 634677 94394 142657 429231 584824 351310 889437 126405 859602 171393 399302 948955 907238 449277 711684 313668 367006 251824 250017 24077 450614 414984 894335 218344 385033 213200 262054 528200 841309 806413 919131 98151 259960 904528 879222 341524 417440 501431 714685 111684 161519 795776 716444 599309 928876 815020 577143 428921 848896 676938 602050 299241 934044 361245 753129 534018 931336 872776 336379 663969 524453 223288 827839 49169 640696 536880 812403 649483 585877 529130 297474 849950 758032 780497 360350 860543 160835 898058 371517 571050 334908 782316 87505 22727 751749 615135 776434 132189 77459…
Output: 11926

Example 3:

Input: 631 304866 353375 464553 716867 120285 481597 101880 646181 590258 310532 387974 283468 675010 860957 22290 496522 794770 893134 592706 667350 592029 208395 643602 169964 44183 288929 360253 510335 145624 759866 229925 821644 22742 848860 445003 133835 367466 292761 551808 255664 231304 390261 460201 566892 415615 887951 281421 837519 412346 466108 995492 314438 646908 172643 174548 730991 860086 354491 585474 974255 178508 85604 959288 560343 358584 627134 890218 125855 550675 520209 691216 589267 323455 379696 930690 84969 526773 591868 605447 393488 672614 964460 665083 354840 783431 156468 285036 579003 304400 512891 423047 462756 168134 79362 283077 74565 182042 370951 654308 942320 615431 682214 843875 777713 848960 704262 330187 578853 406738 26471 434172 933198 178464 630000 931065…
Output: 6823

Constraints:

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

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