A post on facebook is said to be more popular if the number of likes on the post is strictly greater than the number of likes on some other post. In case the number of likes is same, the post having more comments is more popular. Given arrays A and B, each having size N, such that the number of likes and comments on the ith post are Ai and Bi respectively, find out which post is most popular. It is guaranteed that the number of comments on all the posts is distinct. Input Format The first line of input will contain a single integer T, denoting the number of test cases. Each test case consists of multiple lines of input. The first line of each test case contains a single integer N, the number of posts. The second line of each test case contains N space-separated integers A1,A2,…,AN — where Ai is the number of likes on the ith post. The third line of each test case contains N space-separated integers B1,B2,…,BN — where Bi is the number of comments on the ith post. Output Format For each test case, output on a new line, an integer in the range 1 to N, denoting the index of the post which is most popular among the N posts. Constraints 1≤T≤1000 1≤N≤105 1≤Ai,Bi≤2⋅105 The elements of array B are distinct. It is guaranteed that the sum of N over all test case does not exceed 2⋅105
A post on facebook is said to be more popular if the number of likes on the post is strictly greater than the number of likes on some other post. In case the number of likes is same, the post having more comments is more popular. Given arrays A and B, each having size N, such that the number of likes and comments on the ith post are Ai and Bi respectively, find out which post is most popular. It is guaranteed that the number of comments on all the posts is distinct. Input Format The first line of input will contain a single integer T, denoting the number of test cases. Each test case consists of multiple lines of input. The first line of each test case contains a single integer N, the number of posts. The second line of each test case contains N space-separated integers A1,A2,…,AN — where Ai is the number of likes on the ith post. The third line of each test case contains N space-separated integers B1,B2,…,BN — where Bi is the number of comments on the ith post. Output Format For each test case, output on a new line, an integer in the range 1 to N, denoting the index of the post which is most popular among the N posts. Constraints 1≤T≤1000 1≤N≤105 1≤Ai,Bi≤2⋅105 The elements of array B are distinct. It is guaranteed that the sum of N over all test case does not exceed 2⋅105
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
A post on facebook is said to be more popular if the number of likes on the post is strictly greater than the number of likes on some other post. In case the number of likes is same, the post having more comments is more popular.
Given arrays A and B, each having size N, such that the number of likes and comments on the ith post are Ai and Bi respectively, find out which post is most popular.
It is guaranteed that the number of comments on all the posts is distinct.
Input Format
- The first line of input will contain a single integer T, denoting the number of test cases.
- Each test case consists of multiple lines of input.
- The first line of each test case contains a single integer N, the number of posts.
- The second line of each test case contains N space-separated integers A1,A2,…,AN — where Ai is the number of likes on the ith post.
- The third line of each test case contains N space-separated integers B1,B2,…,BN — where Bi is the number of comments on the ith post.
Output Format
For each test case, output on a new line, an integer in the range 1 to N, denoting the index of the post which is most popular among the N posts.
Constraints
- 1≤T≤1000
- 1≤N≤105
- 1≤Ai,Bi≤2⋅105
- The elements of array B are distinct.
- It is guaranteed that the sum of N over all test case does not exceed 2⋅105.
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 4 steps with 1 images
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education