{"kind":"task","effective_mode":"full","benchmark":{"kind":"benchmark","effective_mode":"full","slug":"hlce","formal_name":"Humanity's Last Code Exam","introduction":"ICPC World FinalsとIOIの競技プログラミング問題を使い、問題解決とコード生成の能力を評価します。公式紹介では235問を収録し、今回の取得は公開ICPCデータ146問を対象とします。\n\nHumanity's Last Code Exam evaluates problem solving and code generation using ICPC World Finals and IOI problems. The project describes 235 problems; this import selects its public ICPC dataset of 146 problems.","introduction_ja":"","introduction_en":"","category":"Category not supplied","task_count":null,"acquisition_status":"Acquisition status not supplied","official_url":"https://humanity-s-last-code-exam.github.io/website/","indexing_mode":"noindex"},"task_id":"4e9bb339-a869-5e62-a658-7b6729f0754a","task_key":"ICPC~2dWorld~2dFinals--examples--2023~5fJ","task_revision_id":"1","upstream_id":"2023_J","short_description":"Bridging the Gap","config":"ICPC-World-Finals","split":"examples","body":"{\"platform\":\"atcoder\",\"question_content\":\"A group of walkers arrives at a river in the night. They want to cross a bridge, which can hold a limited number of walkers at a time. The walkers have just one torch, which needs to be used when crossing the bridge. Each walker takes a certain time to cross; a group crossing together must walk at the slowest walker’s pace. What is the shortest time it takes for all walkers to cross the bridge?\\n\\nFor example, Sample Input 1 assumes the bridge can hold 2 walkers at a time and there are 4 walkers with crossing times 1 minute, 2 minutes, 5 minutes, and 10 minutes, respectively. The shortest time of 17 minutes can be achieved by the following sequence of crossings. First, the two fastest walkers cross in 2 minutes. Second, the fastest walker crosses back in 1 minute. Third, the two slowest walkers cross in 10 minutes. Fourth, the second-fastest walker crosses back in 2 minutes. Fifth, the two fastest walkers cross in 2 minutes.\\n\\n### Input\\n\\nThe first line of input contains two integers \\\\( n \\\\) and \\\\( c \\\\), where \\\\( 2 \\\\leq n \\\\leq 10^4 \\\\) is the number of walkers, and \\\\( 2 \\\\leq c \\\\leq 10^4 \\\\) is the number of walkers the bridge can hold at a time. Then follows a line containing \\\\( n \\\\) integers \\\\( t_1, t_2, \\\\ldots, t_n \\\\) (\\\\( 1 \\\\leq t_i \\\\leq 10^9 \\\\) for all \\\\( i \\\\)). The \\\\( i \\\\)-th walker takes time \\\\( t_i \\\\) to cross.\\n\\n### Output\\n\\nOutput the minimum total time it takes for the entire group to cross the bridge.\\n\\n### Sample Input 1\\n\\n```\\n4 2\\n1 2 10 5\\n```\\n\\n### Sample Output 1\\n\\n```\\n17\\n```\\n\\n### Sample Input 2\\n\\n```\\n4 6\\n1 2 10 5\\n```\\n\\n### Sample Output 2\\n\\n```\\n10\\n```\",\"question_title\":\"Bridging the Gap\"}","display_format":"text","language":"","answer_status":"published","assets":[],"source_url":"https://humanity-s-last-code-exam.github.io/website/","history":"initial import","indexing_mode":"noindex","subproblems":[],"grids":[]}