text stringlengths 49 983k |
|---|
#include<iostream>
#include<algorithm>
using namespace std;
bool solve(){
pair<int, int> D[6];
for ( int i = 0; i < 6; i++ ) {
cin >> D[i].first >> D[i].second;
if ( D[i].first > D[i].second) swap(D[i].first, D[i].second);
}
sort(D, D+6);
pair<int, int> F[3];
for ( int i = 0; i < 6; i+=2){
if ( D[i] == D[i+1] ) D[i/2] = D[i];
else return false;
}
return D[0].first == D[1].first && D[0].second == D[2].first && D[1].second == D[2].second;
}
int main(){
if ( solve() ) cout << "yes" << endl;
else cout << "no" << endl;
}
|
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<utility>
#include<vector>
#include<queue>
#include<functional>
#include<map>
#include<set>
#include<cstring>
#include<string>
#include<stack>
#include<math.h>
#include<stdlib.h>
using namespace std;
#define int long long
typedef pair<int, int> pii;
typedef pair<int, pii > piii;
typedef pair<double, double> pdd;
typedef pair<int, char> pic;
typedef priority_queue<pii, vector<pii>, greater<pii> > RPQ;
#define mk make_pair
#define INF (1 << 30)
#define INFL (1ll << 60ll)
#define mod 1000000007
pii t[6];
signed main(){
for(int i = 0; i < 6; i++){
int a,b;
cin >> a >> b;
if(a < b)swap(a, b);
t[i] = mk(a, b);
}
sort(t, t + 6);
bool flag = false;
if(t[0] != t[1]){
flag = true;
}
if(t[2] != t[3]){
flag = true;
}
if(t[4] != t[5]){
flag = true;
}
if(flag){
cout << "no" << endl;
return 0;
}
if(t[0].first == t[2].first){
if((t[0].second == t[4].first && t[2].second == t[4].second) || (t[0].second == t[4].second && t[2].second == t[4].first)){
flag = true;
}
}
if(t[0].first == t[2].second){
if((t[0].second == t[4].first && t[2].first == t[4].second) || (t[0].second == t[4].second && t[2].first == t[4].first)){
flag = true;
}
}
if(t[0].second == t[2].first){
if((t[0].first == t[4].first && t[2].second == t[4].second) || (t[0].first == t[4].second && t[2].second == t[4].first)){
flag = true;
}
}
if(t[0].second == t[2].second){
if((t[0].first == t[4].first && t[2].first == t[4].second) || (t[0].first == t[4].second && t[2].first == t[4].first)){
flag = true;
}
}
if(!flag){
cout << "no" << endl;
}
else {
cout << "yes" << endl;
}
return 0;
}
/*
*/
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int c,q,i,j,z=0,k=1,o=0,m[1001][1001]={0};
int a[1001]={0},b[1001]={0},w[1001]={0},e[6][2]={0};
for(i=0;i<6;i++){
cin>>q>>c;
if(q>c)m[q][c]++;
else m[c][q]++;
}
for(i=0;i<1001;i++){
for(j=0;j<1001;j++){
if(m[i][j]){
if(m[i][j]==4){e[z][0]=i;e[z++][1]=j;e[z][0]=i;e[z++][1]=j;}
else if(m[i][j]==6){e[z][0]=i;e[z++][1]=j;e[z][0]=i;e[z++][1]=j;e[z][0]=i;e[z++][1]=j;}
else{ e[z][0]=i;e[z++][1]=j;}
}
}
}
if(e[0][0]!=e[2][1]||e[1][0]!=e[2][0]||e[0][1]!=e[1][1])k=0;
if(k)cout<<"yes"<<endl;
else cout<<"no"<<endl;
return 0;
} |
#include <iostream>
#include <vector>
#include <set>
#include <algorithm>
using namespace std;
int main() {
vector<vector<int>>v(6);
for (int i = 0; i < 6; i++) {
int x, y;
cin >> x >> y;
if (x > y)swap(x, y);
v[i] = { x,y };
}
sort(v.begin(), v.end());
bool ret = true;
if (v[0] != v[1] || v[2] != v[3] || v[4] != v[5])ret = false;
if (v[0][0] != v[2][0] || v[0][1] != v[4][0] || v[2][1] != v[4][1])ret = false;
cout << (ret ? "yes" : "no") << endl;
}
// START!!! (13:50)
// WA をしないように気を付けてください
// :(
// 大丈夫ですか？？？
// 問題 6 は分かりました、本当にやるだけです
// 問題 1 を AC したら実装します
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int c,q,i,j,z=0,k=1,o=0,m[1001][1001]={0},e[6][2]={0};
for(i=0;i<6;i++){
cin>>q>>c;
if(q>c)m[q][c]++;
else m[c][q]++;
}
for(i=0;i<1001;i++)for(j=0;j<1001;j++){
if(m[i][j]){
if(m[i][j]==4){e[z][0]=i;e[z++][1]=j;e[z][0]=i;e[z++][1]=j;}
else if(m[i][j]==6){e[z][0]=i;e[z++][1]=j;e[z][0]=i;e[z++][1]=j;e[z][0]=i;e[z++][1]=j;}
else{ e[z][0]=i;e[z++][1]=j;}
}
}
if(e[0][0]!=e[2][1]||e[1][0]!=e[2][0]||e[0][1]!=e[1][1])k=0;
if(k)cout<<"yes"<<endl;
else cout<<"no"<<endl;
} |
#include<iostream>
using namespace std;
void swap( int& a, int& b )
{
int temp = a;
a = b;
b = temp;
}
void bubbleSort( int* a, int* b, bool judge )
{
for( int i = 0; i < 6; i++ )
for( int j = 5; j >= 1 + i; j-- )
{
if( a[j] < a[j-1] && judge == 0 )
{
swap( a[j], a[j-1] );
swap( b[j], b[j-1] );
}
if( a[j] == a[j-1] && b[j] < b[j-1] && judge == 1 )
swap( b[j], b[j-1] );
}
}
int main()
{
int a[6], b[6], m[1001][1001] = {{}};
for( int i = 0; i < 6; i++ )
{
cin >> a[i] >> b[i];
if( a[i] > b[i] )
swap( a[i], b[i] );
m[a[i]][b[i]]++;
}
bubbleSort( a, b, 0 );
bubbleSort( a, b, 1 );
int c[7] = {};
for( int i = 0; i < 1001; i++ )
for( int j = 0; j < 1001; j++ )
c[m[i][j]]++;
bool judge = false;
int p[1001] = {};
if( c[2] == 3 )
{
if( a[0] == b[0] && a[2] == b[2] && a[4] == b[4] );
else
{
p[a[0]]++; p[b[0]]++;
p[a[2]]++; p[b[2]]++;
p[a[5]]++; p[b[5]]++;
int cnt = 0;
for( int i = 0; i < 1001; i++ )
if( p[i] == 2 )
cnt++;
judge = cnt == 3 ? 1 : 0;
}
}
else if( c[2] == 1 && c[4] == 1 )
if( a[0] == b[0] && ( a[0] == a[4] || a[0] == b[4] ) || a[4] == b[4] && ( a[4] == a[0] || a[4] == b[0] ) )
judge = true;
else
if( a[0] == b[0] )
judge = true;
if( judge == true )
cout << "yes" << endl;
else
cout << "no" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
vector<pair<int,int> > hw(6);
for(auto&a:hw) {
cin >> a.first >> a.second;
if(a.first<a.second) swap(a.first,a.second);
}
sort(hw.rbegin(),hw.rend());
bool flag=true;
for(int i=0;i<6;i+=2)
if(hw[i]!=hw[i+1]) flag=false;
if(!(hw[0].first==hw[2].first&&hw[0].second==hw[4].first&&
hw[2].second==hw[4].second)) flag=false;
cout << (flag?"yes":"no") << endl;
return 0;
}
|
#include <iostream>
#include <vector>
#include <utility>
#include <algorithm>
using namespace std;
void solve(pair<int, int> &a, pair<int, int> &b, pair<int, int> &c);
int main() {
vector<pair<int, int>> hw(6);
int i;
for (i = 0; i < 6; i++) {
cin >> hw[i].first >> hw[i].second;
if (hw[i].first > hw[i].second) {
swap(hw[i].first, hw[i].second);
}
}
sort(hw.begin(), hw.end());
bool result = true;
vector<pair<int, int>> p(3);
for (i = 0; i < 3; i ++) {
if (!(hw[i * 2] == hw[i * 2 + 1])) {
result = false;
goto OUTPUT;
} else {
p[i] = hw[i * 2];
}
}
for (i = 1; i < 3; i++) {
if (p[i].first == p[i].second) {
swap(p[0], p[i]);
}
}
solve(p[0], p[1], p[2]);
solve(p[1], p[2], p[0]);
solve(p[2], p[0], p[1]);
if (p[0] == p[1] && p[1] == p[2] && p[0].first == 0 && p[0].second == 0) {
result = true;
} else {
result = false;
}
OUTPUT:
cout << (result ? "yes" : "no") << endl;
return 0;
}
void solve(pair<int, int> &a, pair<int, int> &b, pair<int, int> &c) {
if (a.first == b.first) {
a.first = 0;
b.first = 0;
} else if (a.first == b.second) {
a.first = 0;
b.second = 0;
} else if (a.first == c.first) {
a.first = 0;
c.first = 0;
} else if (a.first == c.second) {
a.first = 0;
c.second = 0;
}
if (a.second == b.first) {
a.second = 0;
b.first = 0;
} else if (a.second == b.second) {
a.second = 0;
b.second = 0;
} else if (a.second == c.first) {
a.second = 0;
c.first = 0;
} else if (a.second == c.second) {
a.second = 0;
c.second = 0;
}
return;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int a2,a4,a6,b2,b4,b6,c,q,i,j,z=0,k=1,o=0,m[1001][1001]={0};
int a[1001]={0},b[1001]={0},w[1001]={0},e[6][2]={0};
for(a2=a4=a6=b2=b4=b6=i=0;i<6;i++){
cin>>q>>c;
w[q]++;
w[c]++;
if(q>c)m[q][c]++;
else m[c][q]++;
}
for(i=0;i<1001;i++){
if(w[i])o++;
for(j=0;j<1001;j++){
if(m[i][j]){a[j]+=m[i][j];b[i]+=m[i][j];
if(m[i][j]==4){e[z][0]=i;e[z++][1]=j;e[z][0]=i;e[z++][1]=j;}
else if(m[i][j]==6){e[z][0]=i;e[z++][1]=j;e[z][0]=i;e[z++][1]=j;e[z][0]=i;e[z++][1]=j;}
else{ e[z][0]=i;e[z++][1]=j;}
}
}
}
if(e[0][0]!=e[2][1]||e[1][0]!=e[2][0]||e[0][1]!=e[1][1]||o>3)k=0;
for(i=0;i<1001;i++){
if(w[i]%4)k=0;
if(a[i]==4)a4++;
if(a[i]==2)a2++;
if(a[i]==6)a6++;
if(b[i]==4)b4++;
if(b[i]==2)b2++;
if(b[i]==6)b6++;
}
if(a4&&a2&&b4&&b2&&k||a6&&b4&&b2&&k||b6&&a4&&a2&&k||b6&&a6&&k)cout<<"yes"<<endl;
else cout<<"no"<<endl;
return 0;
} |
#include<algorithm>
#include<functional>
#include<iostream>
int N;
int A, B, C;
int D[100];
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 sum = 0, ans = 0;
for( int i = 0; i != N; ++i )
{
sum += D[i];
ans = std::max( ans, ( C + sum ) / ( A + ( i + 1 ) * B ) );
}
std::cout << ans << std::endl;
return 0;
} |
#include"bits/stdc++.h"
using namespace std;
int main() {
int n, a, b, c;
int masatoy[101];
int max = 0;
cin >> n;
cin >> a >> b;
cin >> c;
max = c / a;
for (int i = 0; i < n; i++) {
cin >> masatoy[i];
}
int nedan = a;
sort(masatoy, masatoy + n);
for (int i = n - 1; i > -1; i--) {
nedan += b;
c += masatoy[i];
int max2 = (c) / nedan;
if (max2 > max) { max = max2; }
}
cout << max << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N, A, B, C, D[101];
cin >> N;
cin >> A >> B >> C;
for(int i = 0; i < N; i++) cin >> D[i];
sort(D, D + N, greater<int>());
for(int i = 1; i < N; i++) D[i] += D[i-1];
int maxical = C / A;
for(int i = 0; i < N; i++) maxical = max(maxical, (C + D[i])/(A + (i+1)*B));
cout << maxical << endl;
return 0;
} |
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main()
{
for(int n;cin>>n;){
int bp,tp; cin>>bp>>tp;
int bc; cin>>bc;
vector<int> tcs(n);
for(int i=0;i<n;i++)
cin>>tcs[i];
sort(tcs.begin(),tcs.end(),greater<int>());
int res=bc/bp;
for(int i=0,j=0;i<n;i++){
j+=tcs[i];
res=max(res,(bc+j)/(bp+tp*(i+1)));
}
cout<<res<<endl;
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
using vi = vector<int>;
using ll = long long;
int main() {
int N, A, B, C;
cin >> N >> A >> B >> C;
vector<int> D(N);
for(int i = 0; i < N; ++i) {
cin >> D[i];
}
sort(D.rbegin(), D.rend());
double ans = (double)C / A;
int total = C;
for(int i = 1; i <= N; ++i) {
total += D[i - 1];
ans = max(ans, (double)total / (i * B + A));
}
cout << (int)ans << endl;
}
|
#include<iostream>
using namespace std;
int d[10000];
int main()
{
int T,N,A,B,C;
int maxk=0;
int K; //????????????
int M; //??????
cin >> N;
cin >> A >> B;
cin >> C;
K = C;
M = A;
for(int i=0;i<N;i++)
cin >> d[i];
for(int i=0;i<N-1;i++){
for(int j=i+1;j<N;j++){
if(d[i] < d[j]){
T = d[i];
d[i] = d[j];
d[j] = T;
}
}
}
maxk = K / M;
for(int i=0;i<N;i++){
K += d[i];
M += B;
if(maxk < K/M)
maxk = K/M;
}
cout << maxk << endl;
return 0;
} |
#include<iostream>
using namespace std;
int main(){
int N,A,B,C;
int t[101];
int i,j,k,w,s,temp;
int pizza;
int max;
cin>>N;
cin>>A>>B;
cin>>C;
max=C/A;
pizza=0;
k=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[i];
t[i]=t[j];
t[j]=temp;
}
}
}
max=C/A;
k=0;
pizza=C;
for(i=0;i<N;i++){
pizza=pizza+t[i];
k++;
w=A+k*B;
if(max<pizza/w){
max=pizza/w;
}
}
cout<<max<<endl;
return 0;
}
|
#include <cstdio>
#include <algorithm>
using namespace std;
int main() {
int n,a,b,c,d[100];
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=0;
for(int i=0;i<n;i++) {
int sum=0;
for(int j=0;j<i;j++)sum+=d[n-j-1];
res=max(res,(sum+c)/(a+b*i));
}
printf("%d\n",res);
} |
#include<iostream>
#include<algorithm>
#include<functional>
#define MAX 100
int n,a,b,c,C[MAX+1],ans,co;
int main(){
int c_=0;
std::cin>>n>>a>>b>>c;
for(int i=1;i<=n;++i){
std::cin>>C[i];
}
co=c/a;
ans=co;
c_+=c;
std::sort(C+1,C+n+1,std::greater<int>());
for(int i=1;i<=n;++i){
c_+=C[i];
ans=std::max(c_/(i*b+a),ans);
}
std::cout<<ans<<std::endl;
return 0;
} |
#include<iostream>
#include<vector>
using namespace std;
int main()
{
int N,A,B,C;
cin>>N>>A>>B>>C;
vector<int>D(N,0);
for(int i=0;i<N;i++)cin>>D[i];
vector< vector<int> >dp(N+1,vector<int>(A+N*B+1,0));
dp[0][A]=C;
for(int i=0;i<N;i++){
for(int j=A;j<=A+N*B;j++){
dp[i+1][j]=max(dp[i+1][j],dp[i][j]);
if(j+B<=A+N*B)dp[i+1][j+B]=max(dp[i][j+B],dp[i][j]+D[i]);
}
}
int ans=0;
for(int j=A;j<=A+N*B;j++){
ans=max(ans,dp[N][j]/j);
}
cout<<ans<<endl;
} |
#include <bits/stdc++.h>
using namespace std;
#define loop(i,n) for(int i=0;i<n;i++)
int d[10002];
int main(){
int n,a,b,c;
cin>>n>>a>>b>>c;
loop(i,n)cin>>d[i];
sort(d,d+n,greater<int>());
int pr=a,kr=c;
int best=c/a;
loop(i,n){
pr+=b;
kr+=d[i];
if(kr/pr>=best)best=kr/pr;
else break;
}
cout<<best<<endl;
return 0;
} |
#include<iostream>
#include <functional>
#include<algorithm>
using namespace std;
int main() {
int n, a, b, i, j, c[1000], ans = 0, s, d,k;
cin >> n >> a >> b >> d;
for (i = 0; i < n; i++) cin >> c[i];
sort(c,c+n,greater<int>());
s = d;
for (i = 0; i < n; i++) {
j = i + 1;
s += c[i];
k = a + b*j;
if (s / k > ans) ans = s / k;
}
if (d / a > ans) ans = d / a;
cout << ans << endl;
cin >> ans;
return 0;
}
|
#include <iostream>
#include <algorithm>
using namespace std;
int main(){
int n,pa,pb,ca,cb[100],bc,tc = 0,tmp;
cin >> n >> pa >> pb >> ca;
for(int i = 0;i < n;++i){
cin >> cb[i];
}
sort(cb,cb+n,greater<int>());
bc = ca /pa;
for(int i = 0;i < n;++i){
tc += cb[i];
tmp = (tc + ca) / (pa + (pb * (i + 1)));
if(tmp > bc){
bc = tmp;
}
}
cout << bc << endl;
return 0;
} |
#include<iostream>
#define N 101001
using namespace std;
int dp[N];
int main(){
int n,a,b,c;
int d[100];
int ans = 0;
cin >> n >> a >> b >>c;
for(int i=0;i<n;i++)cin >> d[i];
for(int j=0;j<N;j++)dp[j] = 0;
dp[a] = c;
for(int i=0;i<n;i++){
for(int j=N-1;j>=a;j--){
if(dp[j] && j+b<=N){
dp[j+b] = max(dp[j+b],dp[j] + d[i]);
}
}
}
for(int j=a;j<N;j++)ans = max(ans,dp[j]/j);
cout << ans << endl;
} |
#include <bits/stdc++.h>
using namespace std;
#define Rep(i,N) for(int i = 0; i < N; i++)
int main()
{
int N;
int A, B, C;
int topi[105];
cin >> N >> A >> B >> C;
Rep(i,N) cin >> topi[i];
sort( topi, topi + N, greater<int>() );
int sum = C;
int maxv = C / A;
Rep(i,N) {
sum += topi[i];
maxv = max(maxv,sum / (A + (i + 1) * B));
}
cout << maxv << endl;
return 0;
} |
#include <iostream>
#include <algorithm>
using namespace std;
int main(){
int n;
double pp,tp;
double pcal,tcal[1000];
cin >> n;
cin >> pp >> tp;
cin >> pcal;
for(int i = 0 ; i < n ; i++ ){
cin >> tcal[i];
}
sort(tcal,tcal + n , greater<int>());
double mx = pcal/pp;
double sumcal = pcal;
for(int i = 0 ; i < n ; i++){
if(mx < sumcal/(pp + tp*i) ) mx = sumcal/(pp + tp*i);
sumcal += tcal[i];
}
cout << (int)mx << endl;
return 0;
} |
#include<stdio.h>
#include<algorithm>
using namespace std;
int t[100];
int max(int a,int b){return a>b?a:b;}
int main(){
int n,a,b,c;
int i,j;
scanf("%d",&n);
scanf("%d %d",&a,&b);
scanf("%d",&c);
for(i=0;i<n;i++)scanf("%d",&t[i]);
sort(t,t+n);
reverse(t,t+n);
int ans=0;
for(i=0;i<=n;i++){
int cal=c;
int p=a+b*i;
for(j=0;j<i;j++)cal+=t[j];
ans=max(ans,cal/p);
}
printf("%d\n",ans);
return 0;
} |
#include<iostream>
#include<string>
#include<algorithm>
#include<cmath>
using namespace std;
int main() {
long long n, a, b, c, sum = 0; cin >> n >> a >> b >> c;
int d[101] = { 0 };
for (int h = 0; h < n; h++) {
cin >> d[h];
}
sort(d, d + n);
for (int h = n - 1; h >= 0; h--) {
if ((c + d[h]) / (a + (sum + 1)*b) >= c / (a + sum * b)) {
c += d[h]; sum++;
}
else {
cout << c / (a + sum * b) << endl;
cin >> n; return 0;
}
}
cin >> n;
}
|
#include <iostream>
#include <algorithm>
using namespace std;
#define NMAX 100
int N;
int A,B,C;
int topping[NMAX+1];
int main(){
cin>>N;
cin>>A>>B;
cin>>C;
for(int i=0;i<N;i++){
cin>>topping[i];
}
sort(topping,topping+N);
int kalory=C;
int money=A;
for(int i=N-1;i>=0;i--){
if((kalory+topping[i])/(money+B)>=kalory/money){
kalory+=topping[i];
money+=B;
}
else break;
}
cout<<kalory/money<<endl;
return 0;
} |
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int n,piza,topping,piza_k;
cin>>n;
cin>>piza;
cin>>topping;
cin>>piza_k;
int topping_k[n];
for(int i=0;i<n;i++) cin>>topping_k[i];
sort(topping_k,topping_k + n);
int max=piza_k/piza;
int sum_d=piza,sum_k=piza_k;
for(int i=n-1;i>=0;i--){
sum_d+=topping;
sum_k+=topping_k[i];
if(max<=sum_k/sum_d) max=sum_k/sum_d;
else break;
}
cout<<max<<endl;
return 0;
} |
//51
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int n,a,b,c;
cin>>n>>a>>b>>c;
int d[10000];
for(int i=0;i<n;i++){
cin>>d[i];
}
sort(d,d+n,greater<int>());
int s=c;
int p=a;
for(int i=0;i<n;i++){
if((s+d[i])*1./(p+b)>s*1./p){
s+=d[i];
p+=b;
}else{
break;
}
}
cout<<s/p<<endl;
return 0;
} |
#include <iostream>
#include <algorithm>
#include <climits>
#include <string>
#include <vector>
#include <cmath>
using namespace std;
int N;
int A, B, 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, greater<int>());
int ans = 0, t = C;
for (int i=0; i<N; i++) {
t += D[i];
ans = max(ans, t / (A + (i+1)*B));
}
cout << ans << "\n";
return 0;
} |
#include<iostream>
using namespace std;
int main(){
int N;
int a,b,c,d;
int max,s,w,best;
int i,j,temp;
int k[1000]={0};
cin>>N>>a>>b>>c;
for(i=0;i<N;i++){
cin>>d;
k[i]=d;
}
for(i=0;i<N;i++){
for(j=N-1;j>i;j--){
if(k[i]<k[j]){
temp=k[i];
k[i]=k[j];
k[j]=temp;
}
}
}
max=c/a;
s=c;
w=a;
for(i=0;i<N;i++){
s=s+k[i];
w=w+b;
best=s/w;
if(max<best){
max=best;
}
}
cout<<max<<endl;
return 0;
} |
#include<iostream>
#include<algorithm>
#include<string>
#include <vector>
using namespace std;
int main(){
int n,a,b,c,d[1000],ans;
int sum=0;
cin>>n;
cin>>a>>b;
cin>>c;
for(int i=0;i<n;i++){
cin>>d[i];
}
sort (d, d+n, greater<int>());
ans=c/a;
for(int i=0;i<n;i++){
sum=sum+d[i];
ans=max(ans,(sum+c)/(a+b*(i+1)));
}
cout<<ans<<endl;
} |
#include<stdio.h>
#include<algorithm>
int main()
{
int N,A,B,C,D[100],i,x=0;
scanf("%d%d%d%d",&N,&A,&B,&C);
for(i=0;i<N;++i)scanf("%d",D+i);
std::sort(D,D+N);
double r=C*1./A;
for(i=0;i<N;)x+=D[N-1-i],r=std::max(r,(C+x)*1./(A+B*++i));
printf("%d\n",(int)r);
return 0;
} |
#include<stdio.h>
int main(void)
{
int a,b,d[100];
int c,i,j,n,kk,dm;
int max,temp,max1;
int cnt;
max=0;
cnt=0;
dm=0;
kk=0;
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;
}
}
}
for(i=0;i<n;i++){
kk=(dm+c)/(a+b*cnt);
dm+=d[i];
cnt++;
if(max<kk){
max=kk;
}
}
printf("%d\n",max);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, c[105], ans = 0, sum;
cin >> n >> a >> b >> sum;
for(int i=0;i<n;i++){
cin >> c[i];
}
sort(c,c+n);
reverse(c,c+n);
for(int i=0;i<n;i++){
sum += c[i];
ans = max(ans, sum/(a+b*(i+1)));
}
cout << ans << endl;
return 0;
}
|
#include<stdio.h>
#include<string.h>
#include<math.h>
int main(void)
{
int f[10000],i,j,k,a,s,d,g,h,z;
scanf("%d %d %d %d",&a,&s,&d,&k);
for(i=1;i<=a;i++)
scanf("%d",&f[i]);
for(i=1;i<=a;i++){
for(j=i+1;j<=a;j++){
if(f[i]<f[j]){
g=f[i];
f[i]=f[j];
f[j]=g;
}
}
}
s+=d;
h=k+f[1];
z=h/s;
for(i=2;i<=a;i++){
s+=d;
h+=f[i];
if(z<h/s){
z=h/s;
}
}
printf("%d\n",z);
return 0;
} |
// 2014/12/10 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);
for(int i=N-1; i>=0; i--){
if(C*(A+B)>=(C+D[i])*A)
break;
C += D[i];
A += B;
}
cout << C/A << endl;
return 0;
} |
#include <iostream>
#include <algorithm>
#include <functional>
using namespace std;
int main() {
int inmu, yj, hide, kiji, db, hage[10000] = {};
cin >> inmu;
cin >> yj >> hide;
cin >> kiji;
for(int i = 0; i < inmu; i++){
cin >> hage[i];
}
sort(hage, hage + inmu, greater<int>());
for(int i = 0; i < inmu; i++){
db = kiji / (yj + hide * i);
kiji += hage[i];
if(db > kiji / (yj + hide * (i + 1))){
cout << db << endl;
break;
}
}
return 0;
} |
#include<cstdio>
#include<algorithm>
int main(void){
int n, a, b, c, d[128], dollar, cal, m;
scanf("%d %d %d %d", &n, &a, &b, &c);
for(int i = 0;i < n; i++) scanf("%d", d + i);
dollar = a; cal = c; m = cal / dollar;
std::sort(d, d + n);
std::reverse(d, d + n);
for(int i = 0;i < n; i++){
dollar += b; cal += d[i];
m = std::max(m, cal / dollar);
}
printf("%d\n", m);
}
|
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
int i, n, a, b, c, d, sum1, sum2, max, ans;
vector<int> data;
cin >> n >> a >> b >> c;
for(i=0; i<n; ++i){
cin >> d;
data.push_back(d);
}
sort(data.begin(), data.end());
for(i=data.size()-1, sum1=c, sum2=a, max=c/a; i>=0; --i){
sum1 += data[i];
sum2 += b;
ans = sum1/sum2;
if(max < ans) max = ans;
}
cout << max << endl;
return 0;
} |
#include <cstdio>
#include <algorithm>
#include <functional>
using namespace std;
int main(){
int n,a,b,c,d[100];
scanf("%d %d %d %d",&n,&a,&b,&c);
for(int i = 0;i < n;i++) scanf("%d",&d[i]);
sort(d,d + n,greater<int>());
int ma = c / a,sum = c;
for(int i = 0;i < n;i++){
sum += d[i];
ma = max(ma,sum / (a + (i + 1) * b));
}
printf("%d\n",ma);
} |
//Best Pizza
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
int N, A, B, C;
cin >> N >> A >> B >> C;
int D[N];
for(int i = 0; i < N; i++) {
cin >> D[i];
}
sort(D, D + N, greater<int>());
int cal = C, p = C / A;
for(int i = 0; i < N; i++) {
cal += D[i];
if(cal / (A + B * (i + 1)) >= p) {
p = cal / (A + B * (i + 1));
continue;
}
break;
}
cout << p << endl;
return 0;
}
|
#include <cstdio>
#include <cmath>
#include <algorithm>
using namespace std;
int d[100];
int main() {
int n,a,b,c; scanf("%d%d%d%d",&n,&a,&b,&c);
for (int i=0; i<n; i++) scanf("%d",&d[i]);
sort(d, d+n);
int sum=c, res=0;
for (int i=n-1; i>=0; i--) {
sum+=d[i];
res=max(res, (int)floor(sum/(a+(n-i)*b)));
}
printf("%d\n",res);
} |
#include<bits/stdc++.h>
using namespace std;
int n,a,b,c,x[100],d,p;
int main(){
p=0;
cin>>n;
cin>>a>>b;
cin>>c;
for(int i=0;i<n;i++){
cin>>x[i];
}
d=0;
sort(x,x+n,greater<int>());
p=c/a;
for(int i=0;i<n;i++){
a += b;
c += x[i];
p=max(p,c/a);
}
cout<<p<<endl;
return 0;
} |
#include<iostream>
#include<algorithm>
#include<functional>
using namespace std;
int main(){
int n,a,b,kiji;
int toppingu[1000];
int besuto=0;
cin>>n>>a>>b>>kiji;
for(int i=0;i<n;i++){
cin>>toppingu[i];
}
int all=kiji;
sort(toppingu,toppingu+n,greater<int>());
for(int i=0;i<=n;i++){
besuto=max(besuto,(all)/(a+b*i));
all+=toppingu[i];
}
cout<<besuto<<endl;
return 0;
} |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
int n,a,b,c;
cin >> n >> a >> b >> c;
vector<int> cal(n);
for(int i=0; i<n; i++) cin >> cal[i];
sort(cal.rbegin(),cal.rend());
int cost = a;
int calory = c;
for(int i=0; i<n; i++){
if(calory / (double)cost > (calory + cal[i]) / (double)(cost + b)) break;
calory += cal[i];
cost += b;
}
cout << calory / cost << endl;
return 0;
} |
#include <iostream>
#include <algorithm>
#include <functional>
#include <cmath>
using namespace std;
int top[100];
int main(){
int n,a,b,c;
cin>>n>>a>>b>>c;
double cl=c,pr=a;
for(int i=0;i<n;++i) cin>>top[i];
sort(top,top+n,greater<int>());
for(int i=0;i<n;++i){
if(cl*b>top[i]*pr) break;
cl +=top[i];pr +=b;
}
cout<<floor(cl/pr)<<endl;
return 0;
} |
#include<algorithm>
#include<iostream>
using namespace std;
int main(){
int i;
int n,a,b,c;
cin>>n>>a>>b>>c;
int d[100];
for(i=0;i<n;++i)
cin>>d[i];
sort(d,d+n,greater<int>());
for(i=0;i<n;++i){
if(c*(a+b)>(c+d[i])*a)
break;
c+=d[i];
a+=b;
}
cout<<(int)((double)c/a)<<endl;
return 0;
} |
#include <stdio.h>
int main(void) {
int i, j, k, n, ans = 0, a, b, c, tmp, now = 0;
scanf("%d%d%d%d", &n, &a, &b, &c);
int t[n];
for(i = 0; i < n; ++i) scanf("%d", &t[i]);
for(i = 0; i < n; ++i) for(j = i + 1; j < n; ++j) if(t[i] < t[j]) tmp = t[i], t[i] = t[j], t[j] = tmp;
for(i = 0; i < n; ++i) {
now += t[i];
if((c + now) / (a + b * (i + 1)) > ans) ans = (c + now) / (a + b * (i + 1));
}
printf("%d\n", ans);
return 0;
}
|
#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
int n, a, b, c, d[100], ans=0, cur;
cin>>n>>a>>b>>c;
for (int i=0; i<n; i++) cin>>d[i];
sort(d, d+n);
reverse(d, d+n);
for (int i=0; i<n; i++)
{
cur=c;
for (int j=0; j<i; j++) cur+=d[j];
cur/=(a+b*i);
ans=max(ans, cur);
}
cout<<ans<<'\n';
return 0;
}
|
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int n,ck,ct,ki;
cin >> n;
cin >> ck >> ct >> ki;
int top[n],cost=ck,ans;
for(int i=0;i<n;i++) cin >> top[i];
sort(top,top+n,greater<int>());
ans = ki / cost;
for(int i=0;i<n;i++){
ki += top[i];
cost += ct;
if(ans<ki/cost) ans = ki / cost;
//else goto END;
}
//END:
cout << ans << endl;
return 0;
} |
#include<iostream>
#include<algorithm>
int main(){
int n,a,b,base,top[101],cal[101];
std::cin>>n>>a>>b>>base;
for(int i=0;i<n;i++)std::cin>>top[i];
std::sort(top+0,top+n);std::reverse(top+0,top+n);
for(int i=0;i<=n;i++){
int all_cal=base;
for(int j=0;j<i;j++)all_cal+=top[j];
cal[i]=all_cal/(a+i*b);
}
std::sort(cal+0,cal+n+1);std::reverse(cal+0,cal+n+1);
std::cout<<cal[0]<<std::endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,a,b,c,d[102];
cin >> n >> a >> b >> c;
int ans = c / a;
for(int i = 0;i < n;i++){
cin >> d[i];
}
sort(d,d+n,greater<int>());
int sum = 0;
for(int i = 1;i <= n;i++){
sum += d[i-1];
ans = max(ans,(c+sum)/(a+b*i));
}
cout << ans << endl;
return 0;
}
|
#include <iostream>
#include <algorithm>
#include <functional>
using namespace std;
int main()
{
int N, A, B, C, Max, sumv, sumc;
int *D;
cin >> N;
D = new int[N];
cin >> A >> B >> C;
for( int i = 0; i < N; i++ ) cin >> D[i];
sort( D, D + N, greater< int >() );
Max = 0;
sumv = 0;
sumc = 0;
for( int i = 0; i < N; i++ ) {
sumv = A + ( i + 1 ) * B;
sumc += D[i];
if( Max < ( sumc + C ) / sumv ) Max = ( sumc + C ) / sumv;
}
cout << Max << endl;
return 0;
} |
#include<stdio.h>
#include<algorithm>
#include<functional>
#include<iostream>
int main()
{
int i, n, a, b, c, d[10000], g, maxv;
scanf("%d", &n);
scanf("%d %d", &a, &b);
scanf("%d", &c);
for (i = 0; i < n; i++){
scanf("%d", &d[i]);
}
std::sort(d, d + n, std::greater<int>());
maxv = c / a;
for (i = 1; i <= n; i++,g = 0){
for (int i2 = 0; i2 < i; i2++){
g += d[i2];
}
maxv = std::max(maxv, (g + c) / (a + i*b));
}
printf("%d\n", maxv);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n,A,B;
cin>>n>>A>>B;
int topping[100],base;
cin>>base;
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 <cstdio>
#include <iostream>
#include <algorithm>
using namespace std;
int t[100];
int s[100];
int main()
{
int n; cin >> n;
int a, b; cin >> a >> b;
int c; cin >> c;
for (int i = 0; i < n; i++) cin >> t[i];
sort(t, t + n, greater<int>());
s[0] = t[0];
for (int i = 1; i < n; i++) s[i] = t[i] + s[i - 1];
int ans = c / a;
for (int i = 1; i <= n; ++i) {
ans = max(ans, (c + s[i - 1]) / (a + b * i));
}
printf("%d\n", ans);
} |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#define int double
using namespace std;
signed main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
vector<int>e(a);
for (int f = 0; f < a; f++)cin >> e[f];
int n = d;
int m = b;
int s = d / b;
sort(e.begin(), e.end());
for (int g =a-1; g!=-1; g--) {
if (s < e[g] / c) { n += e[g]; m += c; s = n / m;}
}
cout << (signed)s << endl;
} |
#include<bits/stdc++.h>
#define N 105
using namespace std;
int main(){
int n,a,b,c,d[N],sum;
double ans;
cin>>n>>a>>b>>c;
sum=c;
for(int i=0;i<n;i++)cin>>d[i];
sort(d,d+n,greater<int>());
ans=sum/a;
for(int i=0;i<n;i++){
sum+=d[i];
ans=max(ans,1.0*sum/(a+b*(i+1)));
}
cout<<(int)ans<<endl;
return 0;
} |
#include<cstdio>
#include<algorithm>
#include<functional>
using namespace std;
int main(){
int n, a, b, cal, pizzas[100];
scanf("%d%d%d%d", &n, &a, &b, &cal);
for(int i = 0;i < n;i++){
scanf("%d", pizzas + i);
}
sort(pizzas, pizzas + n, greater<int>());
int cost = a;
for(int i = 0;i < n;i++){
if((cal + pizzas[i]) / (cost + b) >= cal / cost){
cal += pizzas[i];
cost += b;
}
else break;
}
printf("%d\n", cal / cost);
return 0;
} |
#include <iostream>
#include <vector>
#include <algorithm>
int main(){
int n, a, b, dc;
std::cin >> n >> a >> b >> dc;
std::vector<int> v;
for(int i=0;i<n;i++){
int c;
std::cin >> c;
v.push_back(c);
}
std::sort(v.begin(), v.end(), std::greater<int>());
int max_c = 0, selected_n = 0;
for(int i=0;i<n;i++){
if((a+i*b)*v[i]>b*(dc+max_c)){
max_c += v[i];
selected_n++;
}else{
break;
}
}
std::cout << static_cast<int>(1.0*(max_c+dc)/(a+selected_n*b)) << std::endl;
} |
#include <cstdio>
#include <algorithm>
using namespace std;
int main()
{
int n;
float a, b, c, cal[100];
float ans;
float save, sum = 0;
scanf("%d %d %d %d", &n, &a, &b, &c);
for (int i = 0; i < n; i++){
scanf("%d", &cal[i]);
c += cal[i];
}
sort(cal, cal + n);
ans = c / (a + (b * n));
for (int i = 0; i < n; i++){
sum += cal[i];
save = (c - sum) / (a + (b * (n - i - 1)));
if (ans < save){
ans = save;
}
}
int best;
best = (int)ans;
printf("%d\n", best);
return (0);
} |
#include<cstdio>
#include<algorithm>
using namespace std;
int main(void)
{
int MAX,n,a1,b1,a,b[100],i,cnt;
scanf("%d %d %d %d",&n,&a1,&b1,&a);
for(i=0;i<n;i++){
scanf("%d",&b[i]);
}
sort(b,b+n);
MAX=a/a1;
cnt=0;
for(i=n-1;i>=0;i--){
a+=b[i];
a1+=b1;
MAX=max(MAX,a/a1);
}
printf("%d\n",MAX);
return 0;
}
|
#include<iostream>
#include<algorithm>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
int main(){
int n,a,b,c,d[100];
cin >> n >> a >> b >> c;
rep(i,n) cin >> d[i];
sort( d, d+n );
int sval = a, scal = c;
for(int i=n-1; i>=0; i--){
if( (double)scal/(double)sval < (double)(scal+d[i])/(double)(sval+b) ){
sval += b;
scal += d[i];
}else break;
}
cout << (int)((double)scal/(double)sval) << endl;
return 0;
} |
#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
int main(){
int n, a, b, base, top[100];
scanf(" %d", &n);
scanf(" %d %d", &a, &b);
scanf(" %d", &base);
for(int i=0; i<n; ++i) scanf(" %d", &top[i]);
sort(top, top+n, greater<int>());
double max=(double)base/a;
for(int i=0; i<n; ++i){
double tmp=base;
for(int j=0; j<=i; ++j) tmp+=top[j];
tmp/=(double)a+b*(i+1);
if(tmp>max) max=tmp;
}
printf("%ld\n", (long)max);
return 0;
} |
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main()
{
int n,m,k;
cin >> n >> m >> k;
int p;
vector<int> t(n);
cin >> p;
for(int i=0;i<n;i++)
cin >> t[i];
sort(t.begin(),t.end(),greater<int>());
int ma;
ma=p/m;
for(int i=0;i<n;i++){
p+=t[i];
m+=k;
ma=max(ma,p/m);
}
cout << ma << endl;
return 0;
}
|
#include<cstdio>
#include<algorithm>
using namespace std;
int main(){
int n,a,b,c,d[100];
scanf("%d %d %d %d",&n,&a,&b,&c);
for(int i=0;i<n;i++){
scanf("%d",d+i);
}
sort(d,d+n);
reverse(d,d+n);
int ans = 0;
int cost = a;
int calorie = c;
for(int i=0;i<n;i++){
cost+=b;
calorie+=d[i];
ans = max(ans,calorie/cost);
}
printf("%d\n",ans);
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N,A,B,C;
int D[101];
cin>>N;
cin>>A>>B;
cin>>C;
for(int i=0;i<N;i++){
cin>>D[i];
}
sort(D,D+N,greater<int>());
int ans=-1;
int sum=C;
for(int i=0;i<N;i++){
sum+=D[i];
ans=max(ans,sum/(A+(i+1)*B));
}
cout<<ans<<endl;
} |
#include <iostream>
#include <algorithm>
#include <functional>
using namespace std;
int main(){
int n,a,b,c,topp[101];
cin >> n >> a >> b >> c;
for(int i=0;i<n;i++) cin >> topp[i];
sort(topp,topp + n,greater<int>());
int cal,dol,maxi;
cal = c; dol = a;
maxi = cal/dol;
for(int i=0;i<n;i++){
cal += topp[i];
dol += b;
maxi = (maxi < cal/dol)? cal/dol : maxi;
}
cout << maxi << endl;
} |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<n; i++)
int n;
int A, B, C;
int D[111];
int res;
int sum;
int price;
int main(int argc, char *argv[])
{
cin >> n;
cin >> A >> B;
cin >> C;
rep(i, n) cin >> D[i];
sort(D, D + n, greater<int>());
sum = C;
price = A;
rep(i, n){
sum += D[i];
price += B;
res = max(res, sum / price);
}
cout << res << endl;
return 0;
} |
#include<iostream>
#include<algorithm>
using namespace std;
int n,a,b,e,c,d,maxn,x[10000];
int main(){
cin>>n>>a>>b>>e;maxn=e/a;c=e;d=a;
for(int i=0;i<n;i++){cin>>x[i];}
sort(x,x+n);
for(int i=n-1;i>=0;i--){
d+=b;c+=x[i];maxn=max(maxn,c/d);
}
cout<<maxn<<endl;
return 0;
} |
#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
int main(void){
int n,a,b,c,d=0,cal=0,cal2=0,d2=0,to=0,an=0;
int x[1000]={0};
cin>>n>>a>>b>>c;
cal+=c;
cal2=cal;
d+=a;
d2=d;
to=cal/d;
for(int i=0;i<n;i++){
cin>>x[i];
}
sort(x,x+n);
for(int i=n-1;i>=0;i--){
cal2+=x[i];
d2+=b;
an=cal2/d2;
if(an<to)break;
to=an;
}
cout<<to<<endl;
return 0;
} |
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
int N;
int 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);
reverse(D, D + N);
int ans = 0;
for (int i = 0; i < N; i++) {
int tmp = 0;
for (int j = 0; j < i; j++) {
tmp += D[j];
}
tmp = (tmp + C) / (A + B*i);
if (ans < tmp) ans = tmp;
}
cout << ans << endl;
return 0;
} |
#include <iostream>
#include <algorithm>
using namespace std;
int dp[2][110]={};
int ary[110];
int main(){
int N,A,B,C;
cin>>N>>A>>B>>C;
for(int i=1;i<=N;i++){
cin>>ary[i];
}
int in=0,ou=1;
for(int i=1;i<=N;i++){
for(int j=1;j<=N;j++){
dp[ou][j]=max(dp[in][j],dp[in][j-1]+ary[i]);
}
swap(in,ou);
}
int res=0;
for(int i=1;i<=N;i++){
res=max(res,(dp[in][i]+C)/(A+i*B));
}
cout<<res<<endl;
} |
#include<iostream>
#include<algorithm>
#include<map>
#define MAX 300
using namespace std;
int main(void)
{
int n;
int a , b;
int pizza;
//今までの最高値を格納
double ans = 0;
int top[MAX];
cin >> n;
cin >> a >> b >> pizza;
for (int i = 0; i < n; i++)
{
cin >> top[i];
}
sort(top , top + n , greater<int>());
//初期値
ans = pizza / a;
//貪欲法
for (int i = 0; i < n; i++)
{
a += b;
pizza += top[i];
ans = max(ans , (double)pizza / a);
}
cout << (int)ans << endl;
return 0;
} |
#include<iostream>
#include<algorithm>
using namespace std;
int n, a, b, c, toppings[100], value, cal;
int main()
{
cin >> n >> a >> b >> c;
for(int i = 0; i < n; i++)
{
cin >> toppings[i];
}
value = a;
cal = c;
sort(toppings, toppings + n);
for(int i = n - 1; i >= 0; i--)
{
if(cal / value <= (cal + toppings[i]) / (value + b))
{
value += b;
cal += toppings[i];
}
}
cout << cal / value << endl;
} |
#include<cstdio>
#include<algorithm>
#include<vector>
#include<string>
#include<iostream>
using namespace std;
#define rep(i,n) for(int i=0;i<int(n);i++)
#define reps(i,n) for(int i=1;i<=int(n);i++)
int main(){
int n,a,b,c;
cin>>n>>a>>b>>c;
int sina[111];
rep(i,n)cin>>sina[i];
sort(sina,sina+n);
reverse(sina,sina+n);
rep(i,n){
double val = (double)c/a;
double nextval = (double)(c+sina[i])/(a+b);
if(val<nextval){
a+=b;
c+=sina[i];
}
}
printf("%d\n",c/a);
} |
#include<iostream>
#include<math.h>
#include<algorithm>
using namespace std;
int data[222];
int main(){
int n;
cin>>n;
int A,B;
cin>>A>>B;
int C;
cin>>C;
for(int i=0;i<n;i++)cin>>data[i];
sort(data,data+n,greater<int>());
int cal=C;
int mon=A;
int num=0;
while(1.*cal/mon<1.*(cal+data[num])/(mon+B)){
cal+=data[num++];
mon+=B;
}
cout<<cal/mon<<endl;
} |
#include<stdio.h>
int main(void)
{
int a,b,c,d,x[1001],i,j,X,S,max=0;
scanf("%d%d%d%d",&a,&b,&c,&d);
for(i=0;i<a;i++){
scanf("%d",&x[i]);
}
for(i=0;i<a;i++){
for(j=i;j<a;j++){
if(x[i]<x[j]){
X=x[i];
x[i]=x[j];
x[j]=X;
}
}
}
for(i=0;i<a;i++){
S=d;
for(j=0;j<i;j++){
S+=x[j];
}
if(max<S/(b+c*i)){
max=S/(b+c*i);
}
}
printf("%d\n",max);
return 0;
} |
#include<stdio.h>
#include<algorithm>
using namespace std;
int dat[100];
int main(){
int a,b,c,d;
scanf("%d%d%d%d",&a,&b,&c,&d);
for(int i=0;i<a;i++){
int e;
scanf("%d",&e);
dat[i]=-e;
}
std::sort(dat,dat+a);
int ret=d/b;
for(int i=0;i<a;i++){
int sum=0;
for(int j=0;j<=i;j++)sum-=dat[j];
ret=max(ret,(sum+d)/(b+(i+1)*c));
}
printf("%d\n",ret);
} |
#include <iostream>
#include <algorithm>
#include <cmath>
using namespace std;
int main(){
int n,a,b,c,i,max,p,q;
cin >> n >> a >> b >> c;
int h[n];
i = n;
while(i--)
cin >> h[i];
sort(h,h+n);
p=a;
q=c;
max = floor(q/p);
for(i=0; i<n; i++){
p=a+(i+1)*b;
q+=h[n-i-1];
if(max>floor(q/p))
break;
else
max = floor(q/p);
}
cout << max << endl;
return 0;
} |
#include<stdio.h>
#include<algorithm>
using namespace std;
int max(int a,int b){return a>b?a:b;}
int main(){
int n,i;
int a,b,c;
int d[100];
scanf("%d",&n);
scanf("%d %d %d",&a,&b,&c);
for(i=0;i<n;i++)scanf("%d",&d[i]);
sort(d,d+n);
reverse(d,d+n);
int ans=c/a;
int t=c;
int p=a;
for(i=0;i<n;i++){
t+=d[i];
p+=b;
ans=max(ans,t/p);
}
printf("%d\n",ans);
return 0;
} |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
using namespace std;
int main(){
int n,pp,tp,i,csum=0,psum=0,ans=0;
cin>>n>>pp>>tp;
int pc;
cin>>pc;
vector<int>v(n);
for(i=0;i<n;i++){
cin>>v[i];
}
csum=pc;
psum=pp;
sort(v.begin(),v.end());
for(i=n-1;i>-1;i--){
csum+=v[i];
psum+=tp;
ans=max(ans,csum/psum);
//cout<<csum/psum<<endl;
}
cout<<ans<<endl;
return 0;
} |
#include<bits/stdc++.h>
#include<algorithm>
#include<vector>
#include<queue>
using namespace std;
int main(){
int n,a,b,k,c[100];
scanf("%d%d%d%d",&n,&a,&b,&k);
for(int i=0;i<n;i++) scanf("%d",&c[i]);
sort(c,c+n);
int d=a, res=k/d;
for(int i=n-1;i>=0;i--){
d+=b;k+=c[i];
if(res>k/d)break;
res=k/d;
}
printf("%d\n",res);
} |
//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;
}
}
cout << ans << endl;
} |
#include <set>
#include <cstdio>
#include <algorithm>
#include <queue>
#define REP(i,n) for(int i=0; i<(int)(n); i++)
inline int getInt(){ int s; scanf("%d", &s); return s; }
using namespace std;
int main(){
int n = getInt();
int a = getInt();
int b = getInt();
int c = getInt();
vector<int> v;
REP(i,n) v.push_back(getInt());
sort(v.rbegin(), v.rend());
int ans = c / a;
REP(i,n){ c += v[i]; ans = max(ans, c / (a + b + i * b)); }
printf("%d\n", ans);
return 0;
} |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int n;
while(cin >> n){
int a,b, k_a;
vector<int> v(n);
cin >> a >> b;
cin >> k_a;
for(int i=0;i<n;i++) cin >> v[i];
sort(v.begin(),v.end());
int ans = k_a / a, sum = 0;
for(int i=1;i<=n;i++){
sum += v[n-i];
ans = max(ans,(k_a+sum)/(a+i*b));
}
cout << ans << endl;
}
return 0;
} |
#include<iostream>
#include<queue>
using namespace std;
int money;
priority_queue<int> d;
int n,a,b,c;
int nap[200];
int main()
{
cin>>n>>a>>b>>c;
for(int i=0;i<n;i++)
{
int t;
cin >> t;
d.push(t);
}
double ans=c/a;
int sum_m=a;
int sum_c=c;
while(!d.empty())
{
int tmp =d.top();d.pop();
sum_c+=tmp;
sum_m+=b;
if(ans<(double)sum_c/sum_m)
ans=sum_c/sum_m;
else
break;
}
// int ans = nap(a,c,0);
cout<<(int)ans<<endl;
} |
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
int n, a, b, c;
vector<int> add;
scanf("%d%d%d%d", &n, &a, &b, &c);
add.resize(n);
for(int i = 0; i < n; ++i) {
scanf("%d", &add[i]);
}
sort(add.begin(), add.end());
int cal = c;
int cost = a;
for(int i = n - 1; i >= 0; --i) {
if((cal / cost) <= (cal + add[i]) / (cost + b))
cal += add[i], cost += b;
else
break;
}
printf("%d\n", cal / cost);
return 0;
} |
#include<stdlib.h>
#include<iostream>
#include<stdio.h>
#include<string.h>
#include<math.h>
#include<algorithm>
#include<cstring>
#include<time.h>
#include<queue>
using namespace std;
int t[101];
int main(){
int n;
double a,b,c,cal,pr;
cin>>n;
cin>>a>>b;
cin>>c;
for(int i=0;i<n;i++){
cin>>t[i];
}
std::sort(t,t+n);
cal=c;pr=a;
for(int i=n-1;i>=0;i--){
if(cal/pr<=t[i]/b){
cal+=t[i];
pr+=b;
}
}
cout<<(int)(cal/pr)<<endl;
return 0;
} |
#include<stdio.h>
#include<algorithm>
using namespace std;
int e[1100];
int main(){
int a;scanf("%d",&a);
int b,c;scanf("%d%d",&b,&c);
int d;scanf("%d",&d);
for(int i=0;i<a;i++){
scanf("%d",e+i);
}
std::sort(e,e+a);
int ret=d/b;
int now=d;
int cost=b;
for(int i=a-1;i>=0;i--){
now+=e[i];
cost+=c;
ret=max(ret,now/cost);
}
printf("%d\n",ret);
} |
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
int main()
{
int N, A, B;
cin >> N >> A >> B;
vector<int> dp(N + 1, -INF);
cin >> dp[0];
for (int i = 0; i < N; i++) {
int D;
cin >> D;
for (int j = i; j >= 0; j--) {
dp[j + 1] = max(dp[j + 1], dp[j] + D);
}
}
int res = 0;
for (int i = 0; i <= N; i++) {
res = max(res, dp[i] / (A + B * i));
}
cout << res << endl;
return 0;
}
|
#include <iostream>
#include <algorithm>
using namespace std;
int N;
double A, B;
double C;
int D[101];
int main() {
cin >> N;
cin >> A >> B;
cin >> C;
for(int i = 0; i < N; ++i) {
cin >> D[i];
}
int T[101];
fill(T,T+101,0);
for(int j = 0; j < N; ++j) {
for(int i = N; i >= 1; --i) {
T[i] = max(T[i], T[i-1]+D[j]);
}
}
double maxi = C / A;
for(int i = 1; i <= N; ++i) {
maxi = max(maxi, (C+T[i])/(A+i*B));
}
cout << (int)maxi << endl;
return 0;
} |
#include <algorithm>
#include <iostream>
using namespace std;
int n, a, b, c;
int d[105];
int main() {
cin >> n >> a >> b >> c;
for (int i = 0; i < n; i++) {
cin >> d[i];
}
sort(d, d + n, greater<int>());
int sum = c;
int maxV = 0;
for (int k = 0; k < n; k++) {
sum += d[k];
maxV = max(maxV, sum / (a + b * (k + 1)));
}
cout << maxV << endl;
} |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int k, n, a, b, c;
ll t[1 << 17], d[1 << 17];
int main()
{
cin >> n >> a >> b >> c;
vector<int> v(n);
int ans = a / c;
for (int i = 0; i < n; i++)
{
cin >> v[i];
}
sort(v.rbegin(), v.rend());
int sum = c;
for (int i = 0; i < n; i++)
{
int m = a + b * (i + 1);
sum += v[i];
ans = max(ans, sum / m);
}
cout << ans << endl;
}
|
#include<iostream>
#include<algorithm>
#include<functional>
using namespace std;
int main(){
int n,a,b,c;
cin>>n>>a>>b>>c;
int *co;
co=new int[n];
for(int i=0;i<n;++i) {
cin>>co[i];
}
sort(co,co+n,greater<int>());
int nmax=0;
nmax=c/a;
int monny=c;
for(int i=0;i<n;++i) {
monny+=co[i];
nmax=max(nmax,monny/(a+(i+1)*b));
}
cout<<nmax<<endl;
return 0;
} |
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main() {
int n, a, b, c;
cin >> n >> a >> b >> c;
vector<int> d(n);
for (int &topping : d) {
cin >> topping;
}
sort(d.begin(), d.end());
reverse(d.begin(), d.end());
int answer = 0;
for (int use = 0; use <= n; use++) {
int sum = c;
if (use > 0) {
for (int i = 0; i < use; i++) {
sum += d[i];
}
}
answer = max(answer, sum / (a + b * use));
}
cout << answer << endl;
} |
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
int n, a, b, x, c[100];
double max=0;
cin >> n;
cin >> a >> b;
cin >> x;
for(int i=0; i<n; i++) cin >> c[i];
max=(double)x;
int k=0,q=a;
sort(c, c+n, greater<int>());
while(k<n) {
int p=q;
double z=max;
z+=c[k];
p+=b;
if((double)z/p > (double)max/q) {
max = z;
q=p;
} else {
z-=c[k];
p-=b;
}
k++;
}
cout << (int)max/q << endl;
return 0;
}
|
#include <stdio.h>
int main(void)
{
int a,b,c,d,e[1000],f,i,j,toal;
scanf("%d",&a);
scanf("%d %d",&b,&c);
scanf("%d",&d);
for(i=0;i<a;i++){
scanf("%d",&e[i]);
}
for(i=0;i<a;i++){
for(j=i;j<a;j++){
if(e[i]<e[j]){
f=e[i];
e[i]=e[j];
e[j]=f;
}
}
}
toal=d/b;
for(i=0;i<a;i++){
d=d+e[i];
b=b+c;
f=d/b;
if(f>toal){
toal=f;
}
else if(f<toal){
}
}
printf("%d\n",toal);
return 0;
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.