题库练习 Amr and Chemistry
← 上一题 下一题 →

A9883 | Amr and Chemistry

时间限制1s
内存限制256MB
通过 / 提交0/0

题目描述

Amr loves Chemistry, and specially doing experiments. He is preparing for a new interesting experiment.

Amr has $n$ different types of chemicals. Each chemical $i$ has an initial volume of $a_{i}$ liters. For this experiment, Amr has to mix all the chemicals together, but all the chemicals volumes must be equal first. So his task is to make all the chemicals volumes equal.

To do this, Amr can do two different kind of operations.

- Choose some chemical $i$ and double its current volume so the new volume will be $2a_{i}$
- Choose some chemical $i$ and divide its volume by two (integer division) so the new volume will be ![](/uploads/acgo/image/371190a078da0e18_9de326b68a9e.jpeg)

Suppose that each chemical is contained in a vessel of infinite volume. Now Amr wonders what is the minimum number of operations required to make all the chemicals volumes equal?

输入格式

The first line contains one number $n$ ( $1<=n<=10^{5}$ ), the number of chemicals.

The second line contains $n$ space separated integers $a_{i}$ ( $1<=a_{i}<=10^{5}$ ), representing the initial volume of the $i$ -th chemical in liters.

输出格式

Output one integer the minimum number of operations required to make all the chemicals volumes equal.

输入输出样例

输入 #1
3
4 8 2
输出 #1
2
输入 #2
3
3 5 6
输出 #2
5
C++ 编辑器
输入
输出