Submission #1778017


Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <set>
#include <string>
#include<list>

using namespace std;
#define loop(i,n) for(int i = 0; i < (n); i++)
#define loops(i,f,n) for(int i = (f); i <= (n); i++)
#define VEC vector<int>
#define INF 9999999
#define inta long long
typedef pair<int, int>pii;
typedef pair<int, bool>pib;
// vector<VEC> v (n, VEC(n))
//loop(i,n)loop(j,n)dp[i][j]=-1;
//printf("%d\n", n);

int main()
{
	cin.tie(0);
	cin.sync_with_stdio(0);
	int n, a, b;
	cin >> n >> a >> b;
	int cal;
	cin >> cal;
	vector<int> top(n);
	loop(i, n)cin >> top[i];
	sort(top.rbegin(), top.rend());
	int ans = cal/a;
	loop(i, n)
	{
		cal += top[i];
		ans = max(cal / (a + b*(i+1)),ans);
	}
	cout << ans << endl;
}

Submission Info

Submission Time
Task C - 最高のピザ (Best Pizza)
User keitou
Language C++14 (GCC 5.4.1)
Score 100
Code Size 793 Byte
Status AC
Exec Time 2 ms
Memory 384 KB

Judge Result

Set Name set01 set02 set03 set04 set05
Score / Max Score 20 / 20 20 / 20 20 / 20 20 / 20 20 / 20
Status
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
Set Name Test Cases
set01 data1
set02 data2
set03 data3
set04 data4
set05 data5
Case Name Status Exec Time Memory
data1 AC 1 ms 256 KB
data2 AC 1 ms 256 KB
data3 AC 1 ms 256 KB
data4 AC 2 ms 384 KB
data5 AC 1 ms 256 KB