1 #include<iostream>
 2 #include<cstdio>
 3 #include<cstring>
 4 #include <cmath>
 5 #include<algorithm>
 6 using namespace std;
 7
 8 typedef long long LL;
 9 int a[10005],b[10005];
10
11 int main()
12 {
13     int n,l,i,x,y;
14     double d;
15     cin>>n>>l;
16     for(i=1;i<=n;i++) cin>>a[i];
17     sort(a+1,a+n+1);
18     int maxd=-1;
19     for(i=1;i<n;i++)
20     {
21          b[i]=a[i+1]-a[i];
22         maxd=max(maxd,b[i]);
23     }
24     x=a[1]-0;
25     y=l-a[n];
26 //    printf("x=%d\n",x);
27 //    printf("y=%d\n",y);
28 //    printf("maxd=%d\n",maxd);
29 if(2*x>maxd&&x>=y) printf("%.7lf\n",x*1.0);
30 else if(y>=x&&2*y>maxd) printf("%.7lf\n",y*1.0);
31
32 else printf("%.7lf\n",maxd*0.5);
33
34 }

 1 #include<iostream>
 2 #include<cstdio>
 3 #include<cstring>
 4 #include <cmath>
 5 #include<algorithm>
 6 using namespace std;
 7
 8 typedef long long LL;
 9 struct node{
10     int x,y;
11 } a[100005];
12
13 int cmp(node n1,node n2){
14     if(n1.y!=n2.y) return n1.y<n2.y;
15     return n1.x<n2.x;
16 }
17
18 int main()
19 {
20     LL tmp=0,sum=0,ans=0,c,i, n,r,avg;
21     cin>>n>>r>>avg;
22     for(i=1;i<=n;i++) {
23         cin>>a[i].x>>a[i].y;
24         sum+=a[i].x;
25     }
26     sort(a+1,a+n+1,cmp);
27     ans=n*avg-sum;
28
29 //    for(i=1;i<=n;i++)
30 //    {
31 //        printf("%d %d\n",a[i].x,a[i].y);
32 //    }
33 //    printf("ans=%d\n\n",ans);
34     if(ans<=0) printf("0\n");
35     else
36     {
37         for(i=1;i<=n;i++){
38             if(ans<=(r-a[i].x)){
39                 tmp+=ans*a[i].y;
40                 c=ans;
41             }
42             else{
43                 tmp+=(r-a[i].x)*a[i].y;
44                 c=r-a[i].x;
45             }
46             ans=ans-c;
47             if(ans<=0) break;
48         }
49         printf("%I64d\n",tmp);
50     }
51 }

 1 #include<iostream>
 2 #include<cstdio>
 3 #include<cstring>
 4 #include <cmath>
 5 #include<algorithm>
 6 using namespace std;
 7
 8 typedef long long LL;
 9 LL i,n,x,y,l,r,m,atk,a;
10
11 void bsearch(LL a)
12 {
13     l=1,r=1e15;
14     while(l<r){
15         m=(l+r)/2;
16         atk=m/y+m/x;
17         if(atk>=a) r=m;
18         else l=m+1;
19     }
20     if(l%x==0&&l%y==0) printf("Both\n");
21     else if(l%x==0) printf("Vova\n");
22     else printf("Vanya\n");
23 }
24
25 int main()
26 {
27     cin>>n>>x>>y;
28     for(i=1;i<=n;i++){
29         cin>>a;
30         bsearch(a);
31     }
32     return 0;
33 }