Submission #1777806

---

Source Code Expand

#include <cassert>
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <array>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <system_error>
#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#define NIL -1
using namespace std;
struct _Node {
	int parent;
	int left;
	int right;
};
_Node T[100001];
int main(void)
{
	ios::sync_with_stdio(false);
	int N, kijinedan, toping, karori;
	cin >> N >> kijinedan >> toping >> karori;
	vector<int> arr(N + 1, 0);
	vector<int> kekka(N + 1, 0);
	for (int i = 0; i < N; i++)
	{
		cin >> arr[i];
	}
	sort(arr.begin(), arr.end());
	reverse(arr.begin(), arr.end());
	kekka[N] = karori / kijinedan;
	int karorigoukei = karori;
	for (int i = 0; i < N; i++)
	{
		karorigoukei += arr[i];
		kekka[i] = karorigoukei / (kijinedan + toping*(i + 1));
		cout << kekka[i] << endl;
	}
	sort(kekka.begin(), kekka.end());
	cout << kekka[kekka.size() - 1] << "\n";
}

Submission Info

Judge Result