text stringlengths 49 983k |
|---|
#include <algorithm>
#include <functional>
#include <iostream>
using namespace std;
int main() {
int N,B_val,total_val,total_ca,ans=0,temp;
cin>>N;
int B_ca[N];
cin>>total_val>>B_val;
cin>>total_ca;
for(int i=0 ; i<N ; i++) cin >> B_ca[i];
sort(B_ca, B_ca + N, greater<int>());
for(int i=0 ; i<N+1 ; i++){
temp = total_ca/total_val;
ans = max(ans,temp);
total_ca += B_ca[i];
total_val += B_val;
}
cout << ans << endl;
return 0;
} |
#include <stdio.h>
#include <algorithm>
using namespace std;
int main(){
int N,A,B,C,array[100],i,result = 0,kari;
scanf("%d",&N);
scanf("%d %d",&A,&B);
scanf("%d",&C);
for(i = 0;i < N;i++) scanf("%d",&array[i]);
sort(array,array + N);
reverse(array,array + N);
for(i = 0;i < N;i++){
kari = C / (A + B * i);
if(kari > result) result = kari;
C+=array[i];
}
printf("%d\n",result);
return 0;
} |
#include <cstdio>
#include <algorithm>
using namespace std;
int main(void){
int a,b,re,co,i,p[100];
scanf("%d%d%d%d",&a,&co,&b,&re);
for(i=0;i<a;i++)scanf("%d",p+i);
sort(p,p+a);
for(i=a-1;i>=0;i--){
if((p[i]+re)*co>re*(co+b)){
re+=p[i];co+=b;
}
else break;
}
printf("%d\n",re/co);
return 0;
} |
#include <iostream>
#include <algorithm>
using namespace std;
int n, a, b, c;
int data[101];
int main(){
cin >> n;
cin >> a >> b >> c;
for(int i=0;i<n;i++){
cin >> data[i];
}
sort(data, data+n);
reverse(data, data+n);
int ans = c/a;
int sum = c;
for(int i=1;i<=n;i++){
sum += data[i-1];
if(ans < sum / (a+b*i)){
ans = sum / (a+b*i);
}
}
cout << ans << endl;
return 0;
} |
// 2012/11/19 Tazoe
#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
int N;
cin >> N;
int A, B;
cin >> A >> B;
int C;
cin >> C;
int D[100];
for(int i=0; i<N; i++){
cin >> D[i];
}
sort(D, D+N);
int c_sum = C;
int p_sum = A;
for(int i=N-1; i>=0; i--){
if(c_sum/p_sum>(c_sum+D[i])/(p_sum+B)){
break;
}
else{
c_sum += D[i];
p_sum += B;
}
}
cout << c_sum/p_sum << '\n';
return 0;
} |
#include<stdio.h>
#include<algorithm>
#include<functional>
#include<iostream>
using namespace std;
int main()
{
int i, n, a, b, c, d[10000],g,max;
scanf("%d", &n);
scanf("%d %d", &a, &b);
scanf("%d", &c);
for (i = 0; i < n; i++){
scanf("%d", &d[i]);
}
sort(d, d + n, greater<int>());
max = c / a;
for (i = 1; i <= n; i++){
g = 0;
for (int i2 = 0; i2 < i; i2++){
g += d[i2];
}
g = (g + c) / (a + i*b);
if (max < g)
max = g;
}
printf("%d\n", max);
return 0;
} |
#include <iostream>
#include <algorithm>
#define rep(i, n) for(int i = 0; i < (n); ++i)
using namespace std;
int n, a, b, c;
int d[100];
int main(){
cin >> n >> a >> b >> c;
rep(i, n){
cin >> d[i];
}
sort(d, d + n, greater<int>());
int ans = c / a;
rep(i, n){
c += d[i];
a += b;
ans = max(c / a, ans);
}
cout << ans << endl;
return 0;
} |
#include <iostream>
#include <algorithm>
#include <vector>
void solve() {
int n, a, b, c;
std::cin >> n >> a >> b >> c;
std::vector<int> xs(n);
for (auto& x : xs) std::cin >> x;
std::sort(xs.rbegin(), xs.rend());
int ans = c / a;
for (auto x : xs) {
c += x;
a += b;
ans = std::max(ans, c / a);
}
std::cout << ans << std::endl;
}
int main() {
std::cin.tie(nullptr);
std::ios::sync_with_stdio(false);
solve();
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int dp[105][105]={};
int n,a,b,c;
cin >> n >> a >> b >> c;
int i,j,k;
int cal[n];
for(i=0;i<n;i++) cin >> cal[i];
dp[0][0]=c;
for(i=0;i<n;i++){
for(j=0;j<n;j++){
if(dp[i][j]==0) continue;
dp[i+1][j]=max(dp[i+1][j],dp[i][j]);
dp[i+1][j+1]=max(dp[i+1][j+1],dp[i][j]+cal[i]);
}
}
int ans=0;
for(i=0;i<n;i++){
ans=max(ans,dp[n][i]/(a+b*i));
}
cout << ans << endl;
return 0;
} |
#include <iostream>
using namespace std;
int main(){
int n,pa,pb,ca,*cb,pt,ct;
cin >> n >> pa >> pb >> ca;
cb = new int[n];
for(int i=0; i<n; i++){
cin >> cb[i];
}
for(int i=1; i<n; i++){
if(cb[i] > cb[i-1]){
ct = cb[i-1];
cb[i-1] = cb[i];
cb[i] = ct;
i=0;
}
}
pt = pa;
ct = ca;
for(int i=0; i<n; i++){
if(ct/pt <= (ct+cb[i])/(pt+pb)){
ct += cb[i];
pt += pb;
}else{
break;
}
}
cout << ct/pt << endl;
return 0;
} |
#include <iostream>
#include <algorithm>
using namespace std;
int n, a, b, c;
int data[101];
int main(){
cin >> n;
cin >> a >> b >> c;
for(int i=0;i<n;i++){
cin >> data[i];
}
sort(data, data+n);
reverse(data, data+n);
int ans = c/a;
int sum = c;
for(int i=1;i<=n;i++){
sum += data[i-1];
if(ans <= sum / (a+b*i)){
ans = sum / (a+b*i);
}else{
break;
}
}
cout << ans << endl;
return 0;
} |
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
int n,A,B,C;
cin >> n;
cin >> A >> B >> C;
vector<int> v;
for(int i = 0 ; i < n ; i++){
int in; cin >> in;
v.push_back(in);
}
sort(v.rbegin(),v.rend());
int price = A , cal = C;
double maxCal = (double)cal / price;
for(int i = 0 ; i < n ; i++){
price += B;
cal += v[i];
maxCal = max( maxCal , (double)cal / price ) ;
}
cout << (int)(maxCal+1e-10) << endl;
} |
#include<bits/stdc++.h>
using namespace std;
int n,a,b,k,t[101];
int main(){
cin >> n;
cin >> a >> b;
cin >> k;
for(int i=0;i<n;i++) cin >> t[i];
sort(t,t+n,greater<int>() );
int ans = 0;
for(int i=0;i<=n;i++){
int sum = k;
for(int j=0;j<i;j++){
sum += t[j];
}
int cal = a+i*b;
ans = max(ans,sum/cal);
}
cout << ans << endl;
} |
#include<stdio.h>
#include<algorithm>
#include<functional>
using namespace std;
int main(void)
{
int i,n,a,b,ac,bc[101],s[101];
scanf("%d",&n);
scanf("%d %d",&a,&b);
scanf("%d",&ac);
s[1]=ac;
for(i=1;i<=n;i++){
scanf("%d",&bc[i]);
}
sort(bc+1,bc+n+1,greater<int>());
for(i=1;i<=n;i++){
s[i+1]=s[i]+bc[i];
}
s[1]=s[1]/a;
for(i=2;i<=n+1;i++){
s[i]=s[i]/(a+(b*(i-1)));
}
sort(s+1,s+n+2,greater<int>());
printf("%d\n",s[1]);
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int dp[1000][1000],a,b,c,d[10000],N,lo,li,yu;
double an;
int main(){
cin>>N>>a>>b>>c;
for(int i=0;i<N;i++){
cin>>d[i];
}
sort(d,d+N);
reverse(d,d+N);
lo=c;li=a;
yu=lo/li;
for(int i=0;i<N+1;i++){
lo+=d[i];
li+=b;
yu=max(yu,lo/li);
}
cout<<yu<<endl;
} |
#include<cstdio>
#include<cmath>
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
double bapri,topri,baca,toca[101];
int N;
cin>>N>>bapri>>topri>>baca;
for(int i=0;i<N;i++)cin>>toca[i];
sort(toca,toca+N);
double sumpri=bapri,sumca=baca;
for(int i=N-1;0<=i;i--){
if(sumca/sumpri<toca[i]/topri)sumca+=toca[i],sumpri+=topri;
else break;
}
printf("%d\n",(int)(sumca/sumpri));
return 0;
} |
#include <iostream>
#include <algorithm>
using namespace std;
int main(){
int i,n,bp,tp,bc,tc[100],input,maxc,tmpc,cc;
cin >> n >> bp >> tp >> bc;
for(i = 0;i < n;i++){
cin >> input;
tc[i] = input;
}
sort(tc,tc+n,greater<int>());
maxc = bc / bp;
tmpc = bc;
for(i = 0;i < n;i++){
tmpc += tc[i];
cc = tmpc / (bp + (tp * (i + 1)));
if(cc > maxc) maxc = cc;
}
cout << maxc << endl;
return 0;
} |
#include<iostream>
#include<algorithm>
using namespace std;
static const int MAX_N = 100;
int N;
double A, B, C;
double D[MAX_N];
int main(){
cin >> N;
cin >> A >> B >> C;
for(int i = 0; i < N; i++) cin >> D[i];
sort(D, D + N);
reverse(D, D + N);
double ans = C / A;
double sum_p = A, sum_c = C;
for(int i = 0; i < N; i++){
sum_p += B;
sum_c += D[i];
ans = max(ans, sum_c / sum_p);
}
cout << (int)ans << endl;
}
|
#include <bits/stdc++.h>
int arr[10001];
using namespace std;
int main() {
int n, p1, p2, cal, ans;
std::scanf("%d", &n);
scanf("%d %d", &p1, &p2);
scanf("%d", &cal);
for (int i = 0; i < n; i++) scanf("%d", &arr[i]);
sort(arr, arr+n, greater<int>());
ans = cal / p1;
for (int i = 0; i < n; i++) {
ans = max(ans, (cal + arr[i]) / (p1+p2));
cal+=arr[i], p1+=p2;
}
printf("%d\n", ans);
return 0;
}
|
#include<iostream>
#include<queue>
int n;
int a, b;
int c;
int ans;
std::priority_queue<int> p, q;
int main()
{
std::cin >> n;
std::cin >> a >> b;
std::cin >> c;
for( int i = 0; i < n; i++ ){
int d;
std::cin >> d;
p.push( d );
}
q = p;
for( int k = 0; k <= n; k++ ){
int s = c;
for( int i = 0; i < k; i++ ){
s += q.top(); q.pop();
}
ans = std::max( ans, s / ( a + b * k ) );
q = p;
}
std::cout << ans << std::endl;
return 0;
} |
#include<iostream>
#include<algorithm>
using namespace std;
int N, A, B, C, D[100];
int main(){
cin >> N >> A >> B >> C;
for(int i = 0;i < N;i++) cin >> D[i];
sort(D, D + N);
int ans = C / A, c = C;
for(int k = 0;k < N;k++){
c += D[N - k - 1];
ans = max(ans, c / (A + (k + 1) * B));
}
cout << ans << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define Rep(i, a, b) for(int i = (a); i < (b); i++)
#define rep(i, n) Rep(i, 0, n)
template<class T> T read() {
T t;
cin >> t;
return t;
}
int main(){
int n = read<int>();
int a = read<int>(), b = read<int>();
int c = read<int>();
int d[n];
rep(i,n){
d[i]=read<int>();
}
sort(d,d+n,greater<int>());
int cal = c, price = a;
int ans = cal / price;
rep(i,n){
cal += d[i];
price += b;
ans = max(ans, cal / price);
}
cout << ans << endl;
} |
#include <iostream>
#include <algorithm>
using namespace std;
int main(){
int n;
cin >>n;
int a;
cin >>a;
int b;
cin >>b;
int c;
cin >>c;
int d[n];
int e;
e=0;
while(e<n){
cin>>d[e];
e=e+1;}
sort(d,d+n);
int f;
f=c/a;
int g;
e=n-1;
while(e>=0){
c=c+d[e];
a=a+b;
g=c/a;
if(g<f){break;}
if(g>f){f=g;}
e=e-1;}
cout <<f<<endl;} |
#include <iostream>
#include <algorithm>
using namespace std;
int main(){
int n, a, b, c;
int d[101];
cin >> n >> a >> b >> c ;
for(int i=0 ; i < n ; i++ ){
cin >> d[i];
}
sort( d , d+n );
double ans = 0;
int price, cal, now_price, now_cal;
price = now_price = a;
cal = now_cal = c;
for(int i=n-1 ; i >= 0 ; i-- ){
now_price += b;
now_cal += d[i];
if( (double)cal / price < (double)now_cal / now_price ){
cal = now_cal;
price = now_price;
}
}
cout << cal / price << endl;
} |
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
int N, A, B, C;
scanf("%d\n%d %d\n%d\n", &N, &A, &B, &C);
vector<int> D(N);
for (int i = 0; i < N; ++i) {
scanf("%d\n", &D[i]);
}
sort(D.rbegin(), D.rend());
int price = A, calorie = C;
int res = calorie / price;
for (int i = 0; i < N; ++i) {
price += B;
calorie += D[i];
int cur = calorie / price;
if (res > cur) {
break;
}
res = cur;
}
printf("%d\n", res);
return 0;
} |
#include<iostream>
using namespace std;
int main(){
int n,a,b,ca,x[101],t=0,c=0,st;
double cp;
cin >> n >> a >> b >> ca;
for(int i=0;i<n;i++){
cin>>x[i];
}
for(int i=0;i<n;i++){
for(int j=1;j<n;j++){
if(x[j-1]<x[j]){
st=x[j-1];
x[j-1]=x[j];
x[j]=st;
}
}
}
t+=a;
c+=ca;
for(int i=0;i<n;i++){
cp=(double)c/t;
if((double)x[i]/b>=cp){
t+=b;
c+=x[i];
}
else break;
}
cout << (int)cp << endl;
return 0;
} |
#include <iostream>
#include <algorithm>
#include <functional>
using namespace std;
int main(){
int n = 0, a = 0, b = 0, c = 0, d[10001] = {}, cal,pre,cur, i;
cin >> n >> a >> b>> c;
for (i = 0; i < n; i++){
cin >> d[i];
}
sort(d, d + n, greater<int>());
cal = c;
pre = cal / a;
for (i = 0; i < n; i++){
cal += d[i] ;
cur = cal / (b*(i + 1)+a);
if (pre > cur) {
break;
}
pre = cur;
}
cout << pre << endl;
return 0;
}
|
#include <iostream>
#include <algorithm>
#include <functional>
using namespace std;
int main()
{
int a, b, c, d[100], n;
cin >> n >> a >> b >> c;
for (int i = 0; i < n; i++){
cin >> d[i];
}
sort(d, d + n, greater<int>());
for (int i = 0; i < n - 1; i++){
d[i + 1] += d[i];
}
int max;
max = c / a;
for (int i = 0; i < n; i++){
int e = (c + d[i]) / (a + (i * b) + b);
if (max <= e){
max = e;
}
}
cout << max << endl;
return 0;
} |
#include<cstdio>
#include<algorithm>
#include<string>
using namespace std;
int N,A,B,C;
int D[111];
int main(){
scanf("%d",&N);
scanf("%d %d",&A,&B);
scanf("%d",&C);
for(int i=0;i<N;i++){
scanf("%d",&D[i]);
}
sort(D,D+N);
int res=C/A;
int sum=C;
for(int i=N-1,j=1;i>-1;i--,j++){
sum+=D[i];
res=max(res,sum/(A+j*B));
}
printf("%d\n",res);
} |
#include <bits/stdc++.h>
using namespace std;
int n, a, b, c, x[109];
int main() {
cin >> n >> a >> b >> c;
for(int i = 0; i < n; i++) cin >> x[i];
sort(x, x + n, greater<int>());
int ret = 0, sum = 0;
for(int i = 1; i <= n; i++) {
sum += x[i - 1];
ret = max(ret, (c + sum) / (a + i * b));
}
cout << ret << endl;
return 0;
} |
#include<iostream>
#include<algorithm>
using namespace std;
const int INF=1000000000;
int main(){
int ans,n;
int a,b,t[102],c;
double dans,dn,da,db,dt[102],dc;
scanf("%d%d%d%d",&n,&a,&b,&c);
for(int i=0;i<n;i++)scanf("%d",&t[i]);
for(int i=n;i<102;i++)t[i]=0;
sort(t,t+102);
for(int i=101;i>-1;i--){
dc=c; dt[i]=t[i]; da=a; db=b;
if((dc+dt[i])/(da+db)>dc/da){c+=t[i]; a+=b;}
else break;
}
dc=c; da=a;
ans=(int)dc/da;
printf("%d\n",ans);
} |
#include <iostream>
using namespace std;
int N, A, B, C, D;
int dp[101001];
int main() {
cin >> N >> A >> B >> C;
fill(dp, dp + 101001, 0);
dp[A] = C;
for (int i = 0; i < N; i++) {
cin >> D;
for (int j = A + B * N; j >= A; j--) {
if (dp[j])
dp[j + B] = max(dp[j + B], dp[j] + D);
}
}
int ans = 0;
for (int i = A; i <= A + B * N; i++) {
ans = max(ans, dp[i] / i);
}
cout << ans << endl;
}
|
// 2012/11/19 Tazoe
#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
int N;
cin >> N;
int A, B;
cin >> A >> B;
int C;
cin >> C;
int D[100];
for(int i=0; i<N; i++){
cin >> D[i];
}
sort(D, D+N, greater<int>());
int c_sum = C;
int p_sum = A;
for(int i=0; i<N; i++){
if(c_sum/p_sum>(c_sum+D[i])/(p_sum+B)){
break;
}
else{
c_sum += D[i];
p_sum += B;
}
}
cout << c_sum/p_sum << '\n';
return 0;
} |
#include <iostream>
#include <algorithm>
#include <functional>
using namespace std;
const int MAX_N = 100;
int d[MAX_N];
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
int a, b;
cin >> a >> b;
int c;
cin >> c;
for(int i = 0; i < n; ++i){
cin >> d[i];
}
sort(d, d + n, greater<int>());
int sum = c;
int ans = c / a;
for(int i = 0; i < n; ++i){
sum += d[i];
ans = max(ans, sum / (a + b * (i + 1)));
}
cout << ans << endl;
return 0;
} |
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int n,a,b,cal,ans=0,tcal[101],Scal,sum;
double pcal[101],scal;
cin>>n>>a>>b>>cal;
for(int i=0;i<n;i++){
cin>>tcal[i];
pcal[i]=tcal[i]/b*1.0;
}
sort(tcal,tcal+n,greater<int>());
for(int i=0;i<n;i++){
scal=cal;
sum=a;
for(int j=0;j<i;j++){
scal+=tcal[j];
sum+=b;
}
Scal=scal/sum;
ans=max(ans,Scal);
}
cout<<ans<<endl;
return 0;
} |
#include<iostream>
#include<functional>
#include<algorithm>
using namespace std;
int main()
{
int n,a,b,c;
cin>>n>>a>>b>>c;
int *d;
d=new int[n];
for(int i=0;i<n;i++){cin>>d[i];}
int cal=c/a;
sort(d,d+n,greater<int>());
for(int i=0;i<n;i++){
a+=b;
c+=d[i];
if(cal<c/a){cal=c/a;}
}
cout<<cal<<endl;
delete [] d;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int A,B,C,D[101];
cin>>A>>B>>C;
for(int i=0;i<n;i++)cin>>D[i];
sort(D,D+n,greater<int>());
int ans=0;
for(int i=1;i<=n;i++){
int cost=A+B*i;
int col=C;
for(int j=0;j<i;j++)col+=D[j];
ans=max(ans,col/cost);
}
cout <<ans<<endl;
return 0;
} |
#include <stdio.h>
#include <algorithm>
#include <functional>
using namespace std;
int d[105];
int main(void)
{
int n, a, b, c;
int i, cal;
scanf("%d", &n);
scanf("%d %d", &a, &b);
scanf("%d", &c);
cal = c / a;
for (i = 0; i < n; i++){
scanf("%d", &d[i]);
}
sort(d, d + n, greater<int>());
for (i = 0; i < n; i++){
if (cal * (a + b) < c + d[i]){
c += d[i];
a += b;
cal = c / a;
}
else {
break;
}
}
printf("%d\n", cal);
return (0);
} |
#include <iostream>
#include <algorithm>
using namespace std;
int main(){
int a,b,c,d,sum,max,m[110],sumn;
cin >> a >> b >> c >> d;
sum=d;
sumn=b;
max=d/b;
for(int i=0;i<a;i++)cin >> m[i];
sort(m,m+a);
for(int i=a-1;i>=0;i--){
sum+=m[i];
sumn+=c;
if(max<sum/sumn)max=sum/sumn;
}
cout << max << endl;
} |
#include <iostream>
#include <algorithm>
using namespace std;
int n, a, b, c;
int data[101];
int main(){
cin >> n;
cin >> a >> b >> c;
for(int i=0;i<n;i++){
cin >> data[i];
}
sort(data, data+n);
reverse(data, data+n);
int ans = c/a;
int sum = c;
for(int i=1;i<=n;i++){
sum += data[i-1];
ans = max(ans, sum / (a+b*i));
}
cout << ans << endl;
return 0;
} |
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<string>
using namespace std;
int main(){
int n;
cin >> n;
int a,b;
cin >> a >> b;
int c;
cin >> c;
int top[110] = {0};
for(int i = 0; i < n; i++) cin >> top[i];
sort(top,top+n);
reverse(top,top+n);
//for(int i = 0; i < n; i++) cout << top[i] << endl;
int mx = 0;
mx = c/a;
for(int i = 0; i < n; i++){
c += top[i];
if(mx < c/(a+(b*(i+1)))) mx = c/(a+(b*(i+1)));
}
cout << mx << endl;
return 0;
} |
#include <iostream>
#include <algorithm>
#include <functional>
using namespace std;
int n, p1, p2, res, cl;
int tcl[101];
int main()
{
while(cin>>n && n){
cin >> p1 >> p2 >> cl;
for(int i = 0; i < n; ++i) cin >> tcl[i];
res = cl/p1;
sort(tcl, tcl+n, greater<int>());
for(int i = 0; i < n; ++i){
cl += tcl[i];
p1 += p2;
if(res > cl/p1) break;
res = cl/p1;
}
cout << res << endl;
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n,A,B,base;
cin>>n>>A>>B>>base;
int topping[100];
for(int i=0;i<n;i++)cin>>topping[i];
int ans=base/A;
sort(topping,topping+n);
for(int i=n-1;i>=0;i--)ans=max(ans,(base+=topping[i])/(A+B*(n-i)));
cout<<ans<<endl;
} |
#include<algorithm>
#include<functional>
#include<cstdio>
int main(void){
int n, a, b, c[110]={0}, i;
scanf("%d%d%d", &n, &a, &b);
for(i=0; i<=n; ++i){ scanf("%d", c+i); }
std::sort(c+1, c+1+n, std::greater<int>());
for(i=1; (i<=n)&&((double)(c[0]+c[i])/(a+b)>(double)c[0]/a); c[0]+=c[i], a+=b, ++i);
printf("%d\n", c[0]/a);
return(0);
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,a,b,c,t[150]={0},v=0;
cin>>n>>a>>b>>c;
for(int i=0;i<n;i++){
cin>>t[i];
}
v=c/a;
sort(t,t+n,greater<int>());
int sum=c,money=a;;
for(int i=0;i<n;i++){
if(t[i]/b<v)break;
else {
sum+=t[i];
money+=b;
v=sum/money;
}
}
sum/=money;
cout<<sum<<endl;
return 0;
} |
#include<iostream>
using namespace std;
#define NMAX 10000
int main(){
int N;
int A,B;
int C;
int D[NMAX];
int mon=0;
int col=0;
cin>>N;
cin>>A>>B;
cin>>C;
for(int i=0;i<N;i++){
cin>>D[i];
}
mon=A;
col=C;
int max=col/mon;
for(int i=0;i<N;i++){
int fmax=D[0];
int fi=0;
for(int j=1;j<N;j++){
if(fmax<D[j]) fmax=D[j],fi=j;
}
mon+=B;
col+=fmax;
D[fi]=-1;
if(max<col/mon) max=col/mon;
}
cout<<max<<endl;
} |
#include<iostream>
#include<algorithm>
using namespace std;
static const int MAX = 100;
int main(){
int N, A, B, C;
int V[MAX];
cin >> N >> A >> B >> C;
for ( int i = 0; i < N; i++ ) cin >> V[i];
int sum = 0;
double ans = 0;
sort(V, V + N);
reverse(V, V + N);
for ( int i = 0; i < N; i++ ){
sum += V[i];
ans = max(ans, 1.0*(sum + C)/(A+(i+1)*B));
}
cout << (int)ans << endl;
} |
#include<iostream>
#include<algorithm>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); ++i)
int main() {
int n, a, b, c, cal[100], res, s;
cin >> n >> a >> b >> c;
rep (i, n) cin >> cal[i];
sort(cal, cal + n, greater<int>());
s = c;
res = s / a;
rep (i, n) {
s += cal[i];
res = max(res, s / (a + b * (i + 1)));
}
cout << res << endl;
return 0;
} |
#include<cstdio>
#include<iostream>
#include<algorithm>
#define int long long
using namespace std;
int N,A,B,C,D[101],ans,cal;
signed main(){
cin>>N>>A>>B>>C;
for(int i=0;i<N;i++){
cin>>D[i];
}
sort(D,D+N);
reverse(D,D+N);
ans=C;
for(int i=0;i<N;i++){
ans+=D[i];
cal=max(cal,ans/(A+B*(i+1)));
}
cout<<cal<<endl;
return 0;
} |
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main() {
int n;
double a, b, c;
vector<double>l;
cin >> n >> a >> b >> c;
for (double i = 0; i < n; i++){
double k;
cin >> k;
l.push_back(k);
}
sort(l.begin(), l.end());
double maxc, nc, nd;
nc = c;
nd = a;
maxc = c / a;
for (int i = 1; i < n + 1; i++){
nc += l[n - i];
nd += b;
maxc = max(nc / nd, maxc);
}
cout << (int)maxc << endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int ans,sum,n,a,b,c,pp;
vector <int> piza;
int main(){
cin >> n >> a >> b >> c;
for(int i=0;i<n;i++){
int d;
cin>>d;
piza.push_back(d);
}
sort(piza.begin(),piza.end());
sum=piza[n-1]+c;
ans=sum/(a+b);
pp=2;
for(int i=n-2;i>=0;i--){
sum+=piza[i];
if(ans<=sum/(a+b*(pp)))ans=sum/(a+b*(pp++));
else break;
}
cout << ans << endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main(){
ll n,a,max,cal,yen,tui;
cin>>n>>yen>>tui>>cal;
vector<ll> v;
for(int i=0;i<n;i++){
cin>>a;
v.push_back(a);
}
sort(v.begin(),v.end());
reverse(v.begin(),v.end());
max=cal/yen;
for(int i=0;i<n;i++){
cal+=v[i];
yen+=tui;
if(max<cal/yen)max=cal/yen;
}
cout<<max<<endl;
}
|
#include <iostream>
#include <cmath>
#include <functional>
#include <algorithm>
using namespace std;
int main(){
int N,A,B,KJ;
int tpg[110];//??????????????°????????????
int dp[110];
cin>>N>>A>>B>>KJ;
for(int i=0;i<N;i++){
cin>>tpg[i];
}
sort(tpg,tpg+N,greater<int>());
dp[0]=KJ;
for(int i=0;i<N;i++){
dp[i+1]=dp[i]+tpg[i];
}
int cnt=0;
for(int i=1;i<=N;i++){
cnt=max(cnt,(dp[i]/(A+i*B)));
}
cout<<cnt<<endl;
return 0;
} |
#include <iostream>
#include <algorithm>
#include <functional>
int n;
int a, b, c;
int d[1001];
int main(){
std::cin >> n >> a >> b >> c;
for (int i = 0; i < n; i++)std::cin >> d[i];
std::sort(d, d + n,std::greater<int>());
int max = 0;
for (int i = 0; i < n; i++){
max = std::max(max, c / (a + b * i) );
c += d[i];
}
std::cout << max << std::endl;
return 0;
} |
#include <iostream>
#include <algorithm>
#define int long long
using namespace std;
signed main(){
int n, a, b, c, d[10002] = {0};
cin >> n >> a >> b >> c;
for(int i = 0; i < n; ++i){
cin >> d[i];
}
sort(d, d + n, greater<int>());
int max = 0, cal = c;
for(int i = 0; i < n; ++i){
c += d[i];
int t = c / (a + b * (i + 1));
if(max < t) max = t;
}
cout << max << endl;
return 0;
} |
#include<stdio.h>
int main(void)
{
int n,a,b,c,k[101],i,j,max,x,m;
scanf("%d %d %d %d",&n,&a,&b,&c);
for(i=0;i<n;i++){
scanf("%d",&k[i]);
}
for(i=0;i<n-1;i++){
for(j=i+1;j<n;j++){
if(k[i]<k[j]){
m=k[i];
k[i]=k[j];
k[j]=m;
}
}
}
max=0;
for(i=0;i<n;i++){
x=c;
for(j=0;j<i;j++){
x+=k[j];
}
if(max<x/(a+i*b)){
max=x/(a+i*b);
}
}
printf("%d\n",max);
} |
#include<stdio.h>
#include <iostream>
#include<string.h>
using namespace std;
int main(void)
{
int n,a,b,t[101],i,j,temp,k,x,y,z,c;
cin>>n;
cin>>a>>b;
cin>>k;
for(i=0;i<=n;i++){
t[i]=0;
}
for(i=0;i<n;i++){
cin>>t[i];
}
for(i=0;i<n;i++){
for(j=n-1;j>i;j--){
if(t[i]<t[j]){
temp=t[j];
t[j]=t[i];
t[i]=temp;
}
}
}
x=k;
y=a;
c=x/y;
for(i=0;i<n;i++){
x=x+t[i];
y=y+b;
z=x/y;
if(z>=c){
c=z;
}
else{
break;
}
}
cout<<c<<endl;
return 0;
} |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <functional>
using namespace std;
int main() {
int n, a, b, c, d[10000];
cin >> n;
cin >> a >> b;
cin >> c;
for(int i = 0; i < n; i++)
cin >> d[i];
int pizza = c;
int best = c / a;
sort(d, d + n, greater<int>());
for(int i = 0; i < n; i++){
pizza += d[i];
best = max(best, pizza / (a + (i + 1) * b));
}
cout << best << endl;
return 0;
} |
#include<iostream>
using namespace std;
int main(){
int n=0;
int a=0;
int b=0;
int k=0;
int c[101];
int i=0;
int j=0;
int t=0;
int w=0;
int wa=0;
int s=0;
cin>>n;
cin>>a;
cin>>b;
cin>>k;
for(i=0;i<101;i++){
c[i]=0;
}
for(i=0;i<n;i++){
cin>>c[i];
}
wa=k;
t=k/a;
for(i=0;i<n;i++){
for(j=0;j<n;j++){
if(c[s]<c[j]){
s=j;
}
}
if(t*b<c[s]){
wa=wa+c[s];
w++;
}else{
break;
}
for(j=s;j<100;j++){
c[j]=c[j+1];
}
t=wa/(a+w*b);
s=0;
}
cout<<t<<endl;
} |
#include <iostream>
#include <algorithm>
#include <climits>
#include <string>
#include <vector>
#include <cmath>
using namespace std;
int N;
int A, B;
int C;
int D[110];
int main() {
cin >> N >> A >> B >> C;
for (int i=0; i<N; i++) {
cin >> D[i];
}
sort(D, D+N);
int s = C;
int ans = (int)floor((double)C / (double)A);
for (int k=0; k<N; k++) {
s += D[N-1-k];
ans = max(ans, (int)floor((double)s / (double)(A + (k+1)*B)));
}
cout << ans << "\n";
return 0;
} |
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
int n, a, b, c, d[1000] = { 0 }, p = 0, ans = 0;
cin >> n >> a >> b >> c;
for (int i = 0; i < n; i++) cin >> d[i];
sort(d, d + n);
p = c;
int w = 1;
for (int i = n - 1; i >= 0; i--) {
p += d[i];
if (ans < p / (a + b*w)) ans = p / (a + b*w);
w++;
}
cout << ans << endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<(n);i++)
#define pb push_back
#define all(v) (v).begin(),(v).end()
typedef vector<int>vint;
typedef pair<int,int>pint;
int N,A,B,X,Y[100];
signed main(){
cin>>N>>A>>B>>X;
rep(i,N)cin>>Y[i];
sort(Y,Y+N);reverse(Y,Y+N);
int s=X,t=A,cur=0;
while(cur<N){
if(s*(t+B)>(s+Y[cur])*t)break;
s+=Y[cur++];
t+=B;
}
cout<<s/t<<endl;
return 0;
}
//s/t s+Y[cur]/t+B |
#include <stdio.h>
#include <algorithm>
#include <functional>
int N, A, B, C, D[112];
int ans = -1;
int main(void) {
scanf("%d%d%d%d", &N, &A, &B, &C);
for (int i = 0; i < N; ++i) { scanf("%d", &D[i]); }
std::sort(D, D + N, std::greater<int>());
int greatest_cal = C;
int greatest_dollar = 0;
for (int i = 0; i < N; ++i) {
greatest_cal += D[i];
greatest_dollar = A + B*(i + 1);
ans = std::max(ans, greatest_cal / greatest_dollar);
}
printf("%d\n", ans);
return 0;
} |
#include <iostream>
using namespace std;
int main()
{
int n;
int a,b;
int c;
int s[101];
int x,y;
cin >> n;
cin >> a >> b;
cin >> c;
for(int i=1 ;i<n+1 ;i++){
cin >> s[i];
}
for(int i=1 ;i<n+1 ;i++){
for(int j=1 ;j<n+1 ;j++){
if(s[i] > s[j]){
x = s[i];
s[i] = s[j];
s[j] = x;
}
}
}
x = c;
y = a;
for(int i=1 ;i<n+1 ;i++){
if((x / y) > ((x+s[i])/(y+b)))
break;
else{
x += s[i];
y += b;
}
}
cout << x / y << endl;
return 0;
} |
#include<algorithm>
#include<iostream>
using namespace std;
int main(){
int n,a,b,ans,k;
cin>>n>>a>>b>>k;
int p[1001]={0};
for(int i=0;i<n;i++){
cin>>p[i];
}
for(int i=0;i<n;i++){
for(int j=n-1;j>i;j--){
if(p[i]<p[j]){
swap(p[i],p[j]);
}
}
}
ans=k/a;
int sum=k;
int c=a;
for(int i=0;i<n;i++){
sum+=p[i];
c+=b;
ans=max(ans,sum/c);
}
cout<<ans<<endl;
} |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int n,a,b;
cin>>n;
vector<int> v(n);
cin>>a>>b;
int cal;
cin>>cal;
for(int i=0;i<n;++i)
cin>>v[i];
sort(begin(v),end(v),greater<int>());
int cost = a;
for(int i=0;i<n;++i){
if(cal*(cost+b) > (cal+v[i])*cost)break;
cal += v[i];
cost += b;
}
cout << (cal / cost) << endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,a,b,c,ans,kari;
cin >> n >> a >> b >> c;
int d[n];
for(int i = 0;i < n;i++) cin >> d[i];
sort(d,d+n);
reverse(d,d+n);
c += d[0];
ans = c/(a+b);
for(int i = 1;i < n;i++){
c += d[i];
if(ans < c/(a+b*(i+1)) ){
ans = c/(a+b*(i+1));
}
}
cout << ans << endl;
return 0;
} |
#include<stdio.h>
#include<iostream>
#include<algorithm>
using namespace std;
int t[1001]={0},p[1000]={0};
int main(){
int i,j,a,b,n,l,g,c;
cin>>n>>a>>b>>c;
for(i=1;i<=n;i++)cin>>t[i];
for(i=1;i<=n;i++){
for(j=i+1;j<=n;j++){
if(t[i]<t[j]){
l=t[j];
t[j]=t[i];
t[i]=l;
}
}
}
p[0]=c/a;
g=c;
for(i=1;i<=n;i++){
g=g+t[i];
p[i]=max(p[i-1],g/(a+b*i));
}
cout<<p[n]<<endl;
return 0;
} |
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int N, A, B, C,D[100], ret, hoge;
cin >> N;
cin >> A >> B;
cin >> C;
hoge = C;
ret = hoge / A;
for(int i = 0; i < N; i++){
cin >> D[i];
}
sort( D, D + N, greater<int>());
for(int i = 0; i < N; i++){
hoge += D[i];
ret = max( ret, hoge / ( A + ( i + 1) * B));
}
cout << ret << endl;
} |
#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
int n, a, b, c;
int d[100];
cin >> n >> a >> b >> c;
for (int i = 0; i < n; i++)
cin >> d[i];
sort(d, d + n, greater<int>());
int m = 0, nr = c, dr = a, m1 = nr / dr;
for (int i = 0; i < n; i++) {
m = max(m, m1);
nr += d[i];
dr += b;
m1 = nr / dr;
}
cout << m << endl;
return 0;
}
|
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int n,a,b,c;
cin>>n>>a>>b>>c;
int d[10001];
for(int i=0;i<n;i++)
cin>>d[i];
sort(d,d+n);
int cal=0,co=0;
for(int i=n-1;i>=0;i--)
if((double)(cal+d[i]+c)/((co+1)*b+a)>(double)(cal+c)/(co*b+a))
cal+=d[i],co++;
else
break;
cout<<(cal+c)/(co*b+a)<<endl;
} |
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int n,a,b,c,D[100];
cin>>n>>a>>b>>c;
for(int i=0;i<n;i++){
cin>>D[i];
}
sort(D,D+n);
int ans=0,cost,calorie;
int k;
for(int i=0;i<=n;i++){
k=n-1;
cost=a+b*i;
calorie=c;
for(int j=0;j<i;j++){
calorie+=D[k--];
}
if(calorie/cost>ans) ans=calorie/cost;
}
cout << ans << endl;
return 0;
} |
//AOJ 0567: Best Pizza
#include<iostream>
#include<algorithm>
using namespace std;
const int MAX_N = 100;
int n, a, b, c, ans, cal = 0, cost = 0, tcal[MAX_N];
int main(){
cin >> n >> a >> b >> c;
for (int i = 0; i < n; i++){
cin >> tcal[i];
}
ans = c / a;
cost = a;
cal = c;
sort(tcal, tcal + n);
for (int i = n - 1; i >= 0; i--){
if (ans < tcal[i] / b){
cal += tcal[i];
cost += b;
ans = cal / cost;
}
else break;
}
cout << ans << endl;
} |
#include<stdio.h>
#include<algorithm>
#include<functional>
using namespace std;
int main(void)
{
int n,a,b,c[100],x,y,d;
int i,k;
scanf("%d %d %d %d",&n,&a,&b,&x);
for(i=0;i<n;i++) scanf("%d",&c[i]);
sort(c,c+n,greater<int>());
d=x/a;
for(i=0;i<n;i++){
x=x+c[i];
y=x/(a+(i+1)*b);
if(d<y) d=y;
}
printf("%d\n",d);
return 0;
} |
#include <iostream>
#include <algorithm>
using namespace std;
int main(){
int n;
int A, B, C;
int t[102];
while(cin >> n >> A >> B >> C){
for(int i = 0; i < n; i++){
cin >> t[i];
}
sort(t, t + n, greater<int>());
int maxCal = C / A;
int sumCal = C;
for(int i = 0; i < n; i++){
sumCal += t[i];
maxCal = max(maxCal, sumCal / (A + (i + 1) * B));
}
cout << maxCal << endl;
}
} |
#include<iostream>
#include<queue>
using namespace std;
int main(){
int N,A,B,C;
cin>>N>>A>>B>>C;
priority_queue<int>que;
while(N--){
int v;
cin>>v;
que.push(v);
}
int best=C,prise=A;
while(que.size()){
int v=que.top();que.pop();
double bfr=1.0*best/prise,aft=1.0*(best+v)/(prise+B);
if(bfr<aft){
best+=v;prise+=B;
}
else break;
}
cout<<best/prise<<endl;
} |
#include<stdio.h>
int main(void)
{
int n,a,b,c,d[101];
int i,j,temp;
int max,cal,dol;
int k;
scanf("%d",&n);
scanf("%d %d",&a,&b);
scanf("%d",&c);
for(i=0;i<n;i++){
scanf("%d",&d[i]);
}
for(i=0;i<n-1;i++){
for(j=i+1;j<n;j++){
if(d[i]<d[j]){
temp=d[i];
d[i]=d[j];
d[j]=temp;
}
}
}
max=c/a;
k=0;
cal=c;
dol=a;
for(i=0;i<n;i++){
k++;
cal+=d[i];
dol+=b;
if(max<(cal/dol)){
max=(cal/dol);
}
}
printf("%d\n",max);
return 0;
}
|
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int f(int x,int y){
if(x<y)return false;
return true;
}
int main(){
int n,a,b,c,d,ans[102]={0},max_ans=n;
vector<int> vi;
scanf("%d%d%d%d",&n,&a,&b,&c);
for(int i=0;i<n;i++){
scanf("%d",&d);
vi.push_back(d);
}
sort(vi.begin(),vi.end(),f);
ans[0]=c/a;
for(int i=0;i<n;i++){
c+=vi[i];
a+=b;
ans[i+1]=c/a;
if(ans[i+1]<ans[i]){max_ans=i; break;}
}
printf("%d\n",ans[max_ans]);
} |
#include<stdio.h>
int main(void)
{
int a,s,d,f,g[1002],i,j,k,z,x,c;
z=0;
c=0;
scanf("%d",&a);
scanf("%d %d",&s,&d);
scanf("%d",&f);
for(i=1;i<=a;i++){
scanf("%d",&g[i]);
}
for(i=1;i<=a;i++){
for(j=i+1;j<=a;j++){
if(g[i]<g[j]){
k=g[i];
g[i]=g[j];
g[j]=k;
}
}
}
for(i=1;i<=a;i++){
x=f/s;
// printf("%d %d\n",f,s);
if(c<=x){
c=x;
}
f=f+g[i];
s=s+d;
}
printf("%d\n",c);
return 0;
} |
#include<iostream>
#include<cstdio>
using namespace std;
int main( ){
int n,a,b,c,d=0,max=0,t[101],hi;
cin>>n>>a>>b>>c;
for(int i=1;i<=n;i++){
cin>>t[i];
}
for(int j=1;j<=n;j++){
for(int i=1;i<=n-1;i++){
if(t[i]<t[i+1]){
int tmp;
tmp=t[i];
t[i]=t[i+1];
t[i+1]=tmp;
}
}
}
for(int i=1;i<=n;i++){
d+=t[i];
hi=(c+d)/(a+b*i);
if(hi>max)max=hi;
}
printf("%d\n",max);
return 0;
} |
#include<iostream>
#include<algorithm>
#include<cmath>
using namespace std;
int cal[10005];
int main() {
int n, a, b, c;
cin >> n >> a >> b >> c;
for (int i = 0; i < n; i++) {
cin >> cal[i];
}
sort(cal, cal + n);
double sumcal=c,sumdol=a;
double cado = sumcal / sumdol;
for (int i = n-1; i>-1; i--) {
sumcal += cal[i];
sumdol += b;
double d = sumcal / sumdol;
if (d >= cado) { cado = d; }
else {break;}
}
cado = floor(cado);
int ca = cado;
cout << ca << endl;
return 0;
} |
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<functional>
using namespace std;
int main(void)
{
int n,a,b,c,d[100];
int i,j,cal,dol,mx,c2;
scanf("%d",&n);
scanf("%d %d",&a,&b);
scanf("%d",&c);
for(i=0;i<n;i++) scanf("%d",&d[i]);
sort(d,d+n);
cal=c; dol=a;
mx=c/a;
for(i=n-1;i>=0;i--) {
cal+=d[i];
dol+=b;
mx=max(mx,cal/dol);
}
printf("%d\n",mx);
return 0;
}
|
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int n;
int a,b;
int c;
int d[1000];
int ans;
cin >> n;
cin >> a >> b;
cin >> c;
for(int i=0;i<n;i++) cin >> d[i];
sort(d,d+n);
reverse(d,d+n);
ans = c/a;
for(int i=0;i<n;i++){
if(ans > (c+d[i])/(a+(i+1)*b)) break;
c += d[i];
ans = c/(a+(i+1)*b);
}
cout << ans << endl;
} |
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cmath>
using namespace std;
int main()
{
int n,a,b,c,d[100],m=0,x;
cin>>n>>a>>b>>c;
int start=c/a;
for(int i=0;i<=n-1;i++){
cin>>d[i];
}
sort(d,d+n);
for(int k=1;k<=n;k++){
int sum=0;
for(int i=n-1;i>=n-k;i--){
sum=sum+d[i];
}
x=(sum+c)/(a+b*k);
m=max(m,x);
}
m=max(m,start);
cout<<m<<endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int n,a,b,c,i,x[100],d,p;
int main(){
cin>>n>>a>>b>>c;for(i=0;i<n;i++){cin>>x[i];}d=0;
sort(x,x+n,greater<int>()); p=c/a;
for(i=0;i<n;i++){a+=b;c+=x[i];p=max(p,c/a);}
cout<<p<<endl;} |
#include<stdio.h>
#include<iostream>
using namespace std;
int main(void){
int n,a,b,c,d[10000],i,j,k;
cin>>n>>a>>b>>c;
for(i=0;i!=n;i++)
cin>>d[i];
for(i=0;i!=n;i++){
for(j=i;j!=n;j++){
if(d[i]<d[j]){
k=d[i];
d[i]=d[j];
d[j]=k;
}
}
}
k=c/a;
for(i=0;i!=n;i++){
c+=d[i];
a+=b;
if(k<=c/a)
k=c/a;
else
break;
}
cout<<k<<endl;
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,a,b,c;
int d[1000];
cin>>n>>a>>b>>c;
for(int i=0;i<n;i++){
cin>>d[i];
}
sort(d,d+n,greater<int>() );
int maxs=c/a;
for(int i=0;i<n;i++){
a+=b;
c+=d[i];
maxs=max(maxs,c/a);
}
cout<<maxs<<endl;
}
|
#include<iostream>
using namespace std;
int n,totalc,totald;
double B,total,mx,t[100],tmp;
int main(){
cin>>n;
cin>>totald>>B>>totalc;
total=(double)totalc/totald;
for(int i=0;i<n;i++)cin>>t[i];
for(int i=n-1;i>0;i--){
for(int j=0;j<i;j++){
if(t[j]<t[j+1]){
tmp=t[j];
t[j]=t[j+1];
t[j+1]=tmp;
}
}
}
for(int i=0;i<n;i++){
if(t[i]/B>total){
totalc+=t[i];
totald+=B;
total=totalc/totald;
}
}
cout<<(int)total<<endl;
return 0;
} |
#include <algorithm>
#include <functional>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, A, B, C, ans = 0;
cin >> N >> A >> B >> C;
vector<int> D(N);
for (int& i : D) cin >> i;
sort(D.begin(), D.end(), greater<int>());
for (int i = 1; i < N; ++i) D[i] += D[i - 1];
for (int i = 0; i < N; ++i) ans = max((C + D[i]) / ((1 + i) * B + A), ans);
cout << ans << endl;
}
|
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main() {
int N,A,B,C;
cin >> N >> A >> B >> C;
vector<int> vi(N);
int sum=C;
for(int i=0; i<N; ++i){
cin >> vi[i];
}
sort(vi.begin(),vi.end(),greater<int>());
int result=sum/A;
for(int i=0; i<N; ++i){
sum+=vi[i];
if(result<sum/(A+B*(i+1))) result=sum/(A+B*(i+1));
//else break;
}
cout << result << endl;
return 0;
} |
#include <algorithm>
#include <iostream>
using namespace std;
int n;
int A, B, C;
int D[100];
int main() {
cin >> n;
cin >> A >> B;
cin >> C;
for (int i = 0; i < n; i++) {
cin >> D[i];
}
sort(D, D + n);
reverse(D, D + n);
int max,cal=C,wa;
wa=C/A;
max=wa;
for (int i = 0; i < n; i++) {
cal+=D[i];
A+=B;
wa=cal/A;
if(wa>max) max=wa;
}
cout << max << endl;
return 0;
} |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int a,b,c,n;
cin>>n>>a>>b>>c;
vector<int> cal(n);
for (int i=0; i<n; ++i) cin>>cal[i];
sort(cal.begin(), cal.end(), greater<int>());
double ans = (double)c/a;
int csum = c, psum = a;
for (int i=0; i<n; ++i) {
csum += cal[i];
psum += b;
ans = max(ans, (double)csum/psum);
}
cout<<(int)ans<<endl;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
ll A, B, C;
cin >> N >> A >> B >> C;
vector<ll> D(N);
for (int i = 0; i < N; i++) {
cin >> D[i];
}
sort(D.begin(), D.end(), greater<ll>());
ll ans = 0;
ll s = 0;
for (int i = 0; i < N; i++) {
s += D[i];
ans = max(ans, (C + s) / (A + (i + 1) * B));
}
cout << ans << "\n";
return 0;
}
|
#include<cstdio>
#include<algorithm>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
int main(){
int n,cost_kiji,cost,cal_kiji;
scanf("%d%d%d%d",&n,&cost_kiji,&cost,&cal_kiji);
int cal[100];
rep(i,n) scanf("%d",cal+i);
sort(cal,cal+n);
int ans=cal_kiji/cost_kiji;
int cal_sum=cal_kiji;
rep(i,n){
cal_sum+=cal[n-i-1];
ans=max(ans,cal_sum/(cost_kiji+(i+1)*cost));
}
printf("%d\n",ans);
return 0;
} |
#include <iostream>
#include <algorithm>
#include <functional>
using namespace std;
int main()
{
int n, a, b, c, d[100], i;
double sm, sv, t, u;
cin >> n >> a >> b >> c;
for (i = 0; i < n; i++)
cin >> d[i];
sort(d, d+n, greater<int>());
sm = (double)a, sv = (double)c;
for (i = 0; i < n; i++)
{
t = (sv+d[i])/(sm+b);
u = sv/sm;
if (t > u)
sv+=d[i], sm+=b;
}
cout << (int)(sv/sm) << endl;
} |
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
int n, a, b, c, cal[10001], sum = 0, ans;
cin >> n >> a >> b >> c;
for(int i = 1; i <= n; i++){
cin >> cal[i];
}
cal[0] = 10000;
sort(cal, cal + n + 1, greater<int>());
ans = c / a;
for(int i = 1; i <= n; i++){
sum += cal[i];
ans = max(ans, (c + sum) / (a + b * i));
}
cout << ans << endl;
return 0;
} |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int n; cin >> n;
int A, B; cin >> A >> B;
int C; cin >> C;
vector<int> v(n);
for (int i = 0; i < n; ++i) cin >> v[i];
sort( v.begin(), v.end(), greater<int>() );
int price = A, cal = C;
for (int i = 0; i < v.size(); ++i) {
if ((cal+v[i])/(price+B) >= cal/price) {
price += B, cal += v[i];
}
}
cout << cal/price << endl;
} |
#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
using namespace std;
int main(){
int n;
int a, b, c;
int x[101];
int i;
int cal;
int val;
int ans;
cin>>n>>a>>b>>c;
for(i=0; i<n; i++)
cin>>x[i];
sort(x, x+n, greater<int>());
cal=c;
val=cal/a;
for(i=0; i<n; i++){
cal+=x[i];
ans=cal/(b*(i+1)+a);
if(val>ans)
break;
val=ans;
}
cout<<val<<endl;
return 0;
} |
#include<iostream>
using namespace std;
int main(){
int n,a,b,c,toping[1001],i,i2,toread,max=0,p,q;
cin>>n>>a>>b>>c;
for(i=1;i<=n;i++){
cin>>toping[i];
}
for(i=1;i<=n;i++){
for(i2=1;i2<=n;i2++){
if(toping[i]>toping[i2]){
toread=toping[i];
toping[i]=toping[i2];
toping[i2]=toread;
}
}
}
for(i=1;i<=n;i++){
q=0;
for(i2=1;i2<=i;i2++){
q+=toping[i2];
}
q+=c;
q/=(a+b*i);
if(max<q){
max=q;
}
}
cout<<max<<endl;
} |
#include <cstdio>
#include <algorithm>
#include <functional>
using namespace std;
int main(){
const int MAX_N = 100;
int N, A, B, C, D[MAX_N];
int cal, val, res;
scanf("%d", &N);
scanf("%d%d", &A, &B);
scanf("%d", &C);
for(int i = 0; i < N; i++){
scanf("%d", &D[i]);
}
sort(D, D + N, greater<int>());
cal = C; val = A; res = C / A;
for(int i = 0; i < N; i++){
cal += D[i]; val += B;
res = max(res, cal / val);
}
printf("%d\n", res);
return 0;
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.