BZOJ1816: [Cqoi2010]扑克牌

 1 #include<cstdio>
 2 
 3 #include<cstdlib>
 4 
 5 #include<cmath>
 6 
 7 #include<cstring>
 8 
 9 #include<algorithm>
10 
11 #include<iostream>
12 
13 #include<vector>
14 
15 #include<map>
16 
17 #include<set>
18 
19 #include<queue>
20 
21 #include<string>
22 
23 #define inf 1000000000
24 
25 #define maxn 500+100
26 
27 #define maxm 500+100
28 
29 #define eps 1e-10
30 
31 #define ll long long
32 
33 #define pa pair<int,int>
34 
35 #define for0(i,n) for(int i=0;i<=(n);i++)
36 
37 #define for1(i,n) for(int i=1;i<=(n);i++)
38 
39 #define for2(i,x,y) for(int i=(x);i<=(y);i++)
40 
41 #define for3(i,x,y) for(int i=(x);i>=(y);i--)
42 
43 using namespace std;
44 
45 inline ll read()
46 
47 {
48 
49     ll x=0,f=1;char ch=getchar();
50 
51     while(ch<‘0‘||ch>‘9‘){if(ch==‘-‘)f=-1;ch=getchar();}
52 
53     while(ch>=‘0‘&&ch<=‘9‘){x=10*x+ch-‘0‘;ch=getchar();}
54 
55     return x*f;
56 
57 }
58 ll n,m,a[55];
59 inline bool check(ll x)
60 {
61     ll t=min(m,x);
62     for1(i,n)
63     {
64         if(a[i]<x)
65         {
66             t-=x-a[i];
67             if(t<0)return 0;
68         }
69     }
70     return 1;
71 }
72 
73 int main()
74 
75 {
76 
77     freopen("input.txt","r",stdin);
78 
79     freopen("output.txt","w",stdout);
80 
81     n=read();m=read();
82     for1(i,n)a[i]=read();
83     int l=0,r=inf,mid;
84     while(l<=r)
85     {
86         mid=(l+r)>>1;
87         if(check(mid))l=mid+1;else r=mid-1;
88     }
89     printf("%d\n",r);
90 
91     return 0;
92 
93 }