Submission #1695967

---

Source Code Expand

#include <bits/stdc++.h>
#define REP(i,a,b) for(int i=(a);i<(b);i++)
#define RREP(i,a,b) for(int i=(a);i>=(b);i--)
typedef long long ll; typedef long double ld;
using namespace std;
const int INF=1e9, MOD=1e9+7, around[]={0,1,1,-1,0,-1,1,0,0};
const ld PI=abs(acos(-1));
int n,a,b,c,t[110];

int main(){
	cin >> n >> a >> b >> c;
	REP(i,0,n) cin >> t[i];
	sort(t,t+n); reverse(t,t+n);
	
	int mas=c,mad=a,nos=c,nod=a;
	REP(i,0,n+1){
		if(mas*nod<nos*mad) mad=nod,mas=nos;
		nos+=t[i]; nod+=b;
	}
	
	cout << mas/mad << endl;
	return 0;
}

Submission Info

Judge Result