Pagini recente » Cod sursa (job #2431327) | Cod sursa (job #3138332) | Cod sursa (job #2751860) | Cod sursa (job #2253802) | Cod sursa (job #2336315)
#include <fstream>
#include <math.h>
#include <vector>
#include <set>
#include <algorithm>
#include <cstring>
//#include <unordered_map>
#include <iomanip>
#include <time.h>
#include <stdio.h>
#include <bitset>
#include <map>
#include <ctime>
#include <stdlib.h>
#include "minmax.h"
#define MAX 500000000000
//#include <iostream>
#include <windows.h>
#include <deque>
//#include "PEZai.h"
//#include <Tlhelp32.h>
using namespace std;
using namespace MinMax;
ifstream cin("jocul.in");
ofstream cout("jocul.out");
//ifstream cin("indep.in");
//ofstream cout("indep.out");
int x[104];
int main()
{
int n, sum = 0, k, bsum = 0;
cin >> n;
for(int i = 0; i < n; i++){
cin >> x[i];
sum += x[i];
}
sort(x, x + n);
k = x[n - 1];
for(int i = 0; i < n; i++)
bsum += k - x[i];
while(bsum <= sum)
{
bsum += n;
}
cout << bsum;
}