Favorite Numbers

View as PDF

Submit solution

Points: 5
Time limit: 0.6s
Java 1.0s
Python 2 3.0s
Python 3 3.0s
Turing 3.0s
Memory limit: 256M

Problem type

When asked what his Favorite Number is, Joey cannot respond! He likes a lot of numbers! In particular, he has a list of N (1 \leq N \leq 100\,000) numbers that are his Favorite Numbers. Numbers might appear more than once on his list of Favorite Numbers, but that's okay, since it means that he really, really likes that number.

Joey is given Q (1 \leq Q \leq 100\,000) numbers, but these numbers might not be one of his Favorite Numbers. For each number that he is given, he would like the smallest Favorite Number that is at least as large as the number he is given. He would also like to know how many times that Favorite Number appears in his list of Favorite Numbers.

Please help Joey!

Input Specification

The first line will contain N: the size of Joey's list of Favorite Numbers.

The next line will contain N space-separated integers: the numbers that are in Joey's list of Favorite Numbers, in no particular order.

The next line will contain Q: the amount of numbers Joey is given.

Q lines of input will follow. Each line will contain one integer: one number that Joey is given.

The absolute value of any integer will not exceed 10^9. It is guaranteed that no number given to Joey will exceed the largest number in his list.

Output Specification

On separate lines, for each number that Joey is given, output two space-separated integers: the smallest Favorite Number that is at least as large as the number given, and how many times it appears in Joey's list of Favorite Numbers.

Sample Input

-2 8 -100 19 -2 -2 8 -100 8 8

Sample Output

8 4
8 4
19 1
-100 2
-2 3


  • 4
    kelvin01732  commented on May 12, 2022, 2:05 p.m.

    im not helping joey

    • 1
      FlowerPollinator  commented on May 14, 2022, 9:12 p.m.

      But he can't respond, and only you can help him

  • 3
    ross_cleary  commented on July 13, 2020, 10:11 p.m.

    Data structures tag seems more appropriate.