백준 2512번 예산

https://www.acmicpc.net/problem/2512

#include <cstdio>
#include <algorithm>
#pragma warning(disable:4996)
#define MAX 10000
using namespace std;
int numOfCity;
int city[MAX + 1];
int main()
{
	int sum = 0, result = 0, i = 0;
	scanf("%d", &numOfCity);
	for (int i = 0; i < numOfCity; i++)
		scanf("%d", &city[i]);
	int Budget = 0;
	scanf("%d", &Budget);
	sort(city, city + numOfCity);
	for (i = 0; i < numOfCity; i++)
	{
		if (sum + (city[i] * (numOfCity - i)) >= Budget)
		{
			result = (Budget - sum) / (numOfCity - i);
			break;
		}
		else
			sum += city[i];
	}
	if (i == numOfCity)
		result = city[numOfCity - 1];
	printf("%d\n", result);
	
	return 0;
}