{"problem":{"name":"12. Labyrinth-12","description":{"content":"See the problem statement here: [http://codeforces.com/contest/921/problem/01](//codeforces.com/contest/921/problem/01).","description_type":"Markdown"},"platform":"Codeforces","limit":{"time_limit":8000,"memory_limit":524288},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"CF92112"},"statements":[{"statement_type":"Markdown","content":"See the problem statement here: [http://codeforces.com/contest/921/problem/01](//codeforces.com/contest/921/problem/01).\n\n[samples]","is_translate":false,"language":"English"},{"statement_type":"Markdown","content":"请参见此处的问题陈述：http://codeforces.com/contest/921/problem/01。\n\n[samples]","is_translate":true,"language":"Chinese"},{"statement_type":"Markdown","content":"**Definitions**  \nLet $ n \\in \\mathbb{Z}^+ $ be the number of candles.  \nLet $ h = (h_1, h_2, \\dots, h_n) $ be a sequence of positive integers representing the heights of the candles.  \n\n**Constraints**  \n$ 1 \\le n \\le 100 $,  \n$ 1 \\le h_i \\le 100 $ for all $ i \\in \\{1, \\dots, n\\} $.  \n\n**Objective**  \nFind the minimum number of operations required to make all candles have the same height, where each operation consists of decreasing the height of all candles above a chosen level $ k $ by 1.  \n\nEquivalently, compute:  \n$$\n\\max(h_1, h_2, \\dots, h_n)\n$$","is_translate":false,"language":"Formal"}],"meta":{"iden":"CF92112","tags":[],"sample_group":[],"created_at":"2026-03-03 11:00:39"}}