Submission #14210

#	Time	Username	Problem	Language	Result	Execution time	Memory
14210		khsoo01	Be Two Bees (OJUZ10_b2b)	C++98	11 / 100	1000 ms	2744 KiB

b2b

#include<cstdio>
#include<algorithm>
using namespace std;
long long n,mh,cnt,s,a1,a2;
double mn=1000000000005,t;
bool dom[100005];
struct Data{
    long long h,t;
    bool operator ()(Data q,Data w){
        if(q.t<w.t)return true;
        if(q.t==w.t && q.h>w.h)return true;
        return false;
    }
}r[100005];

int main()
{
    int i,j;
    scanf("%d",&n);
    for(i=0;i<n;s+=r[i++].h)
        scanf("%d",&r[i].h);
    for(i=0;i<n;i++)
        scanf("%d",&r[i].t);
    for(i=0;i<n;i++){
        for(j=i+1;j<n;j++) {
            t=(double)(s-r[i].h-r[j].h)/((double)1/r[i].t+(double)1/r[j].t);
            if(t<mn){
                mn=t;
                a1=i+1;
                a2=j+1;
            }
        }
    }
    printf("%lld %lld",a1,a2);
}

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