Submission #14086

#	Time	Username	Problem	Language	Result	Execution time	Memory
14086		uhmtoto	Be Two Bees (OJUZ10_b2b)	C++98	0 / 100	1000 ms	2256 KiB

b2b

#include <stdio.h>
#include <algorithm>

struct data{
    int num, h, t;
    bool operator <(const data &r) const {
        if(t==r.t) return h<r.t;
        return t<r.t;
    }
} honey[100010];

int main() {
    int n, i;
    scanf("%d", &n);
    for(i=0;i<n;i++) {
        scanf("%d", &honey[i].h);
        honey[i].num=i+1;
    }
    for(i=0;i<n;i++) {
        scanf("%d", &honey[i].t);
    }
    std::sort(honey, honey+n);
    printf("%d %d\n", honey[0].num, honey[1].num);
    return 0;
}

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