2418. Sort the People

Problem Statement

Easy

You are given an array of strings names, and an array heights that consists of distinct positive integers. Both arrays are of length n.

For each index i, names[i] and heights[i] denote the name and height of the i^th person.

Return names sorted in descending order by the people's heights.

Example 1:

Input: names = ["Mary","John","Emma"], heights = [180,165,170]
Output: ["Mary","Emma","John"]
Explanation: Mary is the tallest, followed by Emma and John.

Example 2:

Input: names = ["Alice","Bob","Bob"], heights = [155,185,150]
Output: ["Bob","Alice","Bob"]
Explanation: The first Bob is the tallest, followed by Alice and the second Bob.

Constraints:

n == names.length == heights.length
1 <= n <= 10³
1 <= names[i].length <= 20
1 <= heights[i] <= 10⁵
names[i] consists of lower and upper case English letters.
All the values of heights are distinct.

Java

Source file

class Solution {
    private class Person implements Comparable<Person> {
        String name;
        int height;

        public Person(String name, int height){
            this.name = name;
            this.height = height;
        }

        @Override
        public int compareTo(Person other){
            return Integer.compare(other.height, this.height);
        }

        @Override
        public String toString(){
            return "{"+name+"\t"+height+"}";
        }

    }
    public String[] sortPeople(String[] names, int[] heights) {
        Person[] ppl = new Person[names.length];
        for(int i=0; i<heights.length; i++)
            ppl[i] = new Person(names[i], heights[i]);
        Arrays.sort(ppl);
        // System.out.println(Arrays.toString(ppl));
        return Arrays.stream(ppl).map(p->p.name).toArray(String[]::new);
    }
}