1 second
256 megabytes
standard input
standard output
you are both a shop keeper and a shop assistant at a small nearby shop. you have nn goods, the ii-th good costs aiai coins.
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 nn goods you have.
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 nn goods for the new price, you will receive at least the same (or greater) amount of money as if you sell them for their initial prices.
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 nn goods so if you sell them for this price, you will receive at least the same (or greater) amount of money as if you sell them for their initial prices.
you have to answer qq independent queries.
the first line of the input contains one integer qq (1≤q≤1001≤q≤100) — the number of queries. then qq queries follow.
the first line of the query contains one integer nn (1≤n≤100)1≤n≤100) — the number of goods. the second line of the query contains nn integers a1,a2,…,ana1,a2,…,an (1≤ai≤1071≤ai≤107), where aiai is the price of the ii-th good.
for each query, print the answer for it — the minimum possible equal price of all nn goods so if you sell them for this price, you will receive at least the same (or greater) amount of money as if you sell them for their initial prices.
3 5 1 2 3 4 5 3 1 2 2 4 1 1 1 1
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; }
向上取整向下取整，简单，主要是理解
本文来自网络收集，不代表计算机技术网立场，如涉及侵权请联系管理员删除。
ctvol管理联系方式QQ:251552304
本文章地址：https://www.ctvol.com/c-cdevelopment/601214.html