Chocolate Buying Spree

A kid has a budget of exactly ₹100 and wants to buy chocolates. A list of available chocolates is provided, with each chocolate having a specific price.

Your task is to write a program that calculates two separate metrics based on this scenario:

Maximum Quantity: The absolute maximum number of individual chocolates the kid can buy without exceeding the ₹100 budget. To achieve this, the kid should prioritize buying the cheapest chocolates first.

Maximum Variety: The maximum number of different kinds of chocolates the kid can buy. A "kind" of chocolate is defined by its price. To achieve this, the kid should buy one of each of the cheapest unique kinds of chocolate first.

Input Format:

The first line contains a single integer N, the number of chocolates available.

The second line contains N space-separated integers, representing the prices of the chocolates.

Output Format:

Your function should return the max_quantity and max_variety as a pair or a small array/list.

Note:

These two calculations are independent of each other. The strategy to maximize quantity is different from the strategy to maximize variety, and they should be computed separately.