# 取整

A. Equalize Prices Again
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

You are both a shop keeper and a shop assistant at a small nearby shop. You have

You got tired of remembering the price of each product when customers ask for it, thus you decided to simplify your life. More precisely you decided to set the same price for all

However, you don't want to lose any money so you want to choose the price in such a way that the sum of new prices is not less than the sum of the initial prices. It means that if you sell all

On the other hand, you don't want to lose customers because of big prices so among all prices you can choose you need to choose the minimum one.

So you need to find the minimum possible equal price of all

Input

The first line of the input contains one integer

The first line of the query contains one integer

Output

For each query, print the answer for it — the minimum possible equal price of all

Example
input
Copy
3
5
1 2 3 4 5
3
1 2 2
4
1 1 1 1

output
Copy
3
2
1


#include<iostream>
using namespace std;

int main()
{
int n,q;
cin >> q;
while(q--)
{
int sum = 0,x;
cin >> n;
for(int i = 0;i < n;i++)
{
cin >> x;
sum += x;
}
if(sum % n == 0)
cout << sum / n << endl;
else
cout << sum / n + 1 << endl;

}

return 0;
}

posted @ 2019-10-27 22:49  恶魔岛  阅读(...)  评论(...编辑  收藏