Codeforces Round #590 (Div. 3)A. Equalize Prices Again

AC。根据题意，是一个简单的求中位数，但是为了不亏本，需要向上取整。

#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;

int call(vector<int>* v){
    int mean,sum;
    sum = 0;
    for(auto mem:(*v)){
        sum += mem;
    }
    mean = sum/(v->size());
    if((mean*(v->size()))<sum)
        return mean+1;
    else
        return mean;
}

int main()
{
    int q,n;
    n=0;
    cin>>q;
    while(q){
        cin>>n;
        vector<int>* v=new vector<int>(n,0);
        int i = 0;
        while(i<n){
            cin>>(*v)[i];
            i++;
        }
        cout<<call(v)<<endl;
        delete(v);
        q--;
    }
    return 0;
}