【CF1043A】Elections（签到）

题意：给定n个数字，第i个为a[i]，求使得sigma k-a[i]>sigma a[i]最小的k

n,a[i]<=1e2

思路：

 #include<cstdio>
 #include<cstring>
 #include<string>
 #include<cmath>
 #include<iostream>
 #include<algorithm>
 #include<map>
 #include<queue>
 #include<vector>
 #include<ctime>
 using namespace std;
 typedef long long ll;
 typedef unsigned int uint;
 typedef unsigned long long ull;
 typedef pair<int,int> PII;
 typedef vector<int> VI;
 #define fi first
 #define se second
 #define MP make_pair
 #define N  210000
 #define M  130
 #define MOD 1000000007
 #define eps 1e-8
 #define pi acos(-1)

 int main()
 {
     int n;
     scanf("%d",&n);
     int s=;
     int mx=;
     for(int i=;i<=n;i++)
     {
         int x;
         scanf("%d",&x);
         s+=x;
         mx=max(mx,x);
     }
     int ans=*s/n;
     if(ans*n<=*s) ans++;
     ans=max(ans,mx);
     printf("%d\n",ans);
     return ;
 }