Submission #1613797

---

Source Code Expand

#include<iostream>
#include<vector>
#include<algorithm>
#include<queue>

int N, A, B, C;
int ans, sum, cost;
std::priority_queue<int, std::vector<int>, std::less<int>> top;
int dp[101][101];

int main() {
	std::cin >> N >> A >> B >> C;
	ans = C / A;
	sum += C;
	cost += A;
	for (int i = 1; i <= N; i++) {
		int tmp;
		std::cin >> tmp;
		top.push(tmp);
	}
	for (int i = 0; i < N; i++) {
		int cal;
		int tmp = top.top();
		top.pop();
		sum += tmp;
		cost += B;
		cal = sum / cost;
		if (ans < cal)ans = cal;
	}
	std::cout << ans << std::endl;
}

Submission Info

Judge Result