#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;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
1864 KB |
Output isn't correct |
2 |
Incorrect |
0 ms |
1864 KB |
Output isn't correct |
3 |
Incorrect |
0 ms |
1864 KB |
Output isn't correct |
4 |
Correct |
0 ms |
1864 KB |
Output is correct |
5 |
Correct |
0 ms |
1864 KB |
Output is correct |
6 |
Correct |
0 ms |
1864 KB |
Output is correct |
7 |
Correct |
0 ms |
1864 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
1864 KB |
Output is correct |
2 |
Correct |
0 ms |
1864 KB |
Output is correct |
3 |
Incorrect |
0 ms |
1864 KB |
Output isn't correct |
4 |
Correct |
0 ms |
1864 KB |
Output is correct |
5 |
Incorrect |
0 ms |
1864 KB |
Output isn't correct |
6 |
Incorrect |
0 ms |
1864 KB |
Output isn't correct |
7 |
Correct |
0 ms |
1864 KB |
Output is correct |
8 |
Correct |
0 ms |
1864 KB |
Output is correct |
9 |
Correct |
0 ms |
1864 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
19 ms |
1864 KB |
Output isn't correct |
2 |
Incorrect |
15 ms |
1864 KB |
Output isn't correct |
3 |
Incorrect |
18 ms |
1864 KB |
Output isn't correct |
4 |
Incorrect |
14 ms |
1864 KB |
Output isn't correct |
5 |
Incorrect |
24 ms |
1864 KB |
Output isn't correct |
6 |
Incorrect |
20 ms |
1864 KB |
Output isn't correct |
7 |
Incorrect |
25 ms |
1864 KB |
Output isn't correct |
8 |
Incorrect |
30 ms |
1864 KB |
Output isn't correct |
9 |
Incorrect |
16 ms |
1864 KB |
Output isn't correct |
10 |
Incorrect |
10 ms |
1864 KB |
Output isn't correct |
11 |
Correct |
0 ms |
1864 KB |
Output is correct |
12 |
Incorrect |
22 ms |
1864 KB |
Output isn't correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
29 ms |
1864 KB |
Output is correct |
2 |
Correct |
32 ms |
1864 KB |
Output is correct |
3 |
Correct |
23 ms |
1864 KB |
Output is correct |
4 |
Incorrect |
31 ms |
1864 KB |
Output isn't correct |
5 |
Correct |
27 ms |
1864 KB |
Output is correct |
6 |
Correct |
15 ms |
1864 KB |
Output is correct |
7 |
Correct |
13 ms |
1864 KB |
Output is correct |
8 |
Correct |
18 ms |
1864 KB |
Output is correct |
9 |
Correct |
29 ms |
1864 KB |
Output is correct |
10 |
Incorrect |
31 ms |
1864 KB |
Output isn't correct |
11 |
Incorrect |
0 ms |
1864 KB |
Output isn't correct |
12 |
Correct |
0 ms |
1864 KB |
Output is correct |
13 |
Correct |
8 ms |
1864 KB |
Output is correct |
14 |
Incorrect |
14 ms |
1864 KB |
Output isn't correct |
15 |
Incorrect |
0 ms |
1864 KB |
Output isn't correct |
16 |
Incorrect |
25 ms |
1864 KB |
Output isn't correct |
17 |
Incorrect |
30 ms |
1864 KB |
Output isn't correct |