{"raw_statement":[{"iden":"statement","content":"See the problem statement here: [http://codeforces.com/contest/921/problem/01](//codeforces.com/contest/921/problem/01)."}],"translated_statement":[{"iden":"statement","content":"请参见此处的问题陈述：http://codeforces.com/contest/921/problem/01。\n\n"}],"sample_group":[],"show_order":[],"formal_statement":"**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$$","simple_statement":null,"has_page_source":false}