Submission #14147

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
14147	2015-05-02 08:43:23	minchurl	Be Two Bees (OJUZ10_b2b)	C++98	11 / 100	1000 ms	1864 KiB

b2b

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include<stdio.h>
#define oo 0x7fffffff
int h[100005],n,dapx,dapy,t[100005];
double dap;
FILE *in;
int main(){
    int i,j,sum=0;
    double x,y;
    scanf("%d",&n);
    for(i=0;i<n;i++){
        scanf("%d",&h[i]);
        sum+=h[i];
    }
    dap=oo;
    for(i=0;i<n;i++)    scanf("%d",&t[i]);
    for(i=0;i<n;i++){
        for(j=i+1;j<n;j++){
            x=sum-h[i]-h[j];
            y=1/((double)t[i])+1/((double)t[j]);
            x=x/y;
            if(x<dap){
                dap=x;
                dapx=i+1;
                dapy=j+1;
            }
        }
    }
    printf("%d %d\n",dapx,dapy);
    return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 11 / 11
• Subtask 2: 0 / 22
• Subtask 3: 0 / 28
• Subtask 4: 0 / 39