Codeforces 962D（优先队列）

题目链接： 点击打开链接

题目描述：

D. Merge Equals

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

You are given an array of positive integers. While there are at least two equal elements, we will perform the following operation. We choose the smallest value $x$ that occurs in the array $2$ or more times. Take the first two occurrences of $x$ in this array (the two leftmost occurrences). Remove the left of these two occurrences, and the right one is replaced by the sum of this two values (that is, $2\cdot x$).

Determine how the array will look after described operations are performed.

For example, consider the given array looks like $[3,4,1,2,2,1,1]$. It will be changed in the following way: $[3,4,1,$