Problema
In C#, an IComparer<T> is an interface: any class that implements its Compare method can tell a sort which item comes first. Choosing a different comparer changes the order without changing the sort.
Sort the people by key:
name: by name (ordinal character order, so uppercase letters come before lowercase), and by age when names are equal.age: by age, youngest first, and by name when ages are equal.
Implement sort_by_key(names, ages, key).
Input
names, ages: The people (same length).
key: "name" or "age".
Output
Return the names in sorted order.
Restrições
0 ≤ number of people ≤ 100,000
0 ≤ age ≤ 150
Exemplos
Entrada:
key = "age"
ages = [30, 36, 30]
names = ["Lin", "Ada", "Bo"]
Saída esperada:
expected = ["Bo", "Lin", "Ada"]Entrada:
std::string key = "age";
std::vector<long long> ages = {30, 36, 30};
std::vector<std::string> names = {"Lin", "Ada", "Bo"};
Saída esperada:
std::vector<std::string> expected = {"Bo", "Lin", "Ada"};Entrada:
string key = "age";
long[] ages = new long[] {30, 36, 30};
string[] names = new string[] {"Lin", "Ada", "Bo"};
Saída esperada:
string[] expected = new string[] {"Bo", "Lin", "Ada"};Explicação
Bo and Lin are both 30, so they are ordered by name before Ada (36): ["Bo", "Lin", "Ada"].
Entrada:
key = "name"
ages = [30, 36, 30]
names = ["Lin", "Ada", "Bo"]
Saída esperada:
expected = ["Ada", "Bo", "Lin"]Entrada:
std::string key = "name";
std::vector<long long> ages = {30, 36, 30};
std::vector<std::string> names = {"Lin", "Ada", "Bo"};
Saída esperada:
std::vector<std::string> expected = {"Ada", "Bo", "Lin"};Entrada:
string key = "name";
long[] ages = new long[] {30, 36, 30};
string[] names = new string[] {"Lin", "Ada", "Bo"};
Saída esperada:
string[] expected = new string[] {"Ada", "Bo", "Lin"};Explicação
Alphabetical order: ["Ada", "Bo", "Lin"].
Como abordar
Tente sozinho primeiro e depois abra uma dica de cada vez.
Dica 1
Sort pairs of (name, age) instead of two separate lists.
Dica 2
The chosen key gives the main order; the other field breaks ties.
Dica 3
Use ordinal string comparison so uppercase sorts before lowercase.
Complexidade esperada
O(n log n) time, O(n) extra space
Referências
Este desafio foi adaptado para o CodeUtility. Siga o enunciado e as restrições acima.