-
Notifications
You must be signed in to change notification settings - Fork 3
/
Copy pathCODECHEF_MOVIEWKN.c
68 lines (68 loc) · 883 Bytes
/
CODECHEF_MOVIEWKN.c
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
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
//CodeChef Problem : Movie Weekend (Beginner)
//Problem Code : MOVIEWKN
//Author : PIYUSH
#include<stdio.h>
int main()
{
int t,n,l[102],ans[102],r[102],re[102],in[102],i,j,max,count,r_count;
scanf("%d",&t);
while(t--)
{
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&l[i]);
}
for(i=0;i<n;i++)
{
scanf("%d",&r[i]);
}
for(i=0;i<n;i++)
{
ans[i]=l[i]*r[i];
}
max=1;
for(i=0;i<n;i++)
{
if(ans[i]>max)
max=ans[i];
}
count=0;
for(i=0,j=0;i<n;i++)
{
if(max == ans[i])
{
count++;
in[j]=i;
j++;
}
}
max=1;
if(count==1)
{
printf("%d\n",in[0]+1);
}
else
{
for(i=0;i<n;i++)
{
if(r[i]>max)
{
max=r[i];
}
}
r_count=0;
for(i=0,j=0;i<n;i++)
{
if(max==r[i])
{
r_count++;
re[j]=i;
j++;
}
}
printf("%d\n",re[0]+1);
}
}
return 0;
}