Sort the strings based on the numbers of matchsticks required to represent them

// Java implementation to sort the 
// strings with the number of 
// sticks required to represent them 

import java.io.*;
import java.util.*;

class GFG{
    // Stick[] stores the count 
    // of sticks required to 
    // represent the alphabets 
    static int sticks[] = { 6, 7, 4, 6, 5, 4, 6, 
                    5, 2, 4, 4, 3, 6, 6, 
                    6, 5, 7, 6, 5, 3, 5, 
                    4, 6, 4, 3, 4 }; 
    
    // Number[] stores the count 
    // of sticks required to 
    // represent the numerals 
    static int number[] = { 6, 2, 5, 5, 4, 5, 6, 
                    3, 7, 6 }; 
    
    // Function that return the count of 
    // sticks required to represent 
    // the given string str 
    
    static class Pair implements Comparable<Pair>{
        int num_sticks;
        String str;
        
        Pair(int n, String s)
        {
            num_sticks = n;
            str=s;
        }
        
        public int compareTo(Pair p)
        {
            return this.num_sticks-p.num_sticks;
        }
    }
    static int countSticks(String str) 
    { 
        int cnt = 0; 
        int n=str.length();
        
        // Loop to iterate over every 
        // character of the string 
        for (int i = 0; i < n; i++) { 
    
            char ch = str.charAt(i); 
    
            // Add the count of sticks 
            // required to represent the 
            // current character 
            if (ch >= 'A' && ch <= 'Z') { 
                cnt += sticks[ch - 'A']; 
            } 
            else { 
                cnt += number[ch - '0']; 
            } 
        } 
        return cnt; 
    } 
    
    // Function to sort the array 
    // according to the number of 
    // sticks required to represent it 
    static void sortArr(String arr[], int n)  
    { 
        // ArrayList to store the number 
        // of sticks required with 
        // respective strings 
        ArrayList<Pair> list = new ArrayList<>();
    
        // Inserting number of sticks 
        // with respective strings 
        for (int i = 0; i < n; i++) { 
            list.add( 
                new Pair(countSticks(arr[i]), 
                        arr[i])); 
        } 
    
        // Sort the list, 
        Collections.sort(list);
    
        // Print the sorted vector 
        for (int i = 0; i < list.size(); i++) 
            System.out.print(list.get(i).str + " "); 
    } 
    
    // Driver Code 
    public static void main(String []args)
    { 
        String arr[] = { "GEEKS", "FOR", 
                        "GEEKSFORGEEKS" }; 
        int n = arr.length;
    
        sortArr(arr, n); 
    } 
}