Submission #14197

#	Time	Username	Problem	Language	Result	Execution time	Memory
14197		heohyun0703	Be Two Bees (OJUZ10_b2b)	C++98	0 / 100	32 ms	1864 KiB

b2b

#include <stdio.h>
int n;
int d[100001];
int t[100001];
int main()
{
    int min=999999999,mini;
    int min2=999999999,mini2;
    int i;
    scanf("%d",&n);
    for(i=1; i<=n; i++){
        scanf("%d",&d[i]);
    }
    for(i=1; i<=n; i++){
        scanf("%d",&t[i]);
    }
    for(i=1; i<=n; i++){
        if(t[i] < min){
            min = t[i];
            mini = i;
        }
    }
    for(i=1; i<=n; i++){
        if(t[i] < min2 && i != mini){
            min2 = t[i];
            mini2 = i;
        }
    }
    if(mini < mini2) printf("%d %d\n",mini,mini2);
    else printf("%d %d\n",mini2,mini);
    return 0;
}

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