Sort an array From highest to lowest

I am trying to sort an array in Java, I want top 3 value only.

// A:55,B:45,C:5,D:35,E:35,F:1

       int a[] = {A,B,C,D,E,F};

	   float first =0;
	   float second=0;
	   float third =0;

	   for (int i=0; i<a.length; i++){
	       if(first <= a[i]){
	           first=a[i];
	       }
	   }System.out.println("first largest is "+first);

	   for (int j=0; j<a.length; j++){
	       if(a[j] <=first && a[j] > second){
	           second = a[j];
	       }
	   }System.out.println("second largest is "+second);

	   for (int k=0;k<a.length; k++){
	       if(a[k]<=second && a[k]>third){
	    	      	   
	           third =a[k];
	       }
	   }System.out.println("third largest is "+third);

Another thing here is that if A and B are equal, it should give me A and if D and E are equal it should provide D as answer. So final answer should be ABD.

you can store in the variable first,second,third the index instead of value

I rewrite the code quickly it not optimal but I think it can help

    public static void main(String[] args) {

    char names[] = {'A', 'B', 'C', 'D', 'E', 'F'};
    int values[] = {55, 45, 5, 35, 35, 1, Integer.MIN_VALUE};

    int first = values.length - 1;
    int second = values.length - 1;
    int third = values.length - 1;

    for (int i = 0; i < values.length; i++) {
        if (values[first] < values[i]) {
            first = i;
        }
    }
    System.out.println("first largest is " + names[first]);

    for (int j = 0; j < values.length; j++) {
        if (j != first && values[second] < values[j]) {
            second = j;
        }
    }
    System.out.println("second largest is " + names[second]);

    for (int k = 0; k < values.length; k++) {
        if (k != first && k != second && values[third] < values[k]) {

            third = k;
        }
    }
    System.out.println("third largest is " + names[third]);

}

I added the Integer.MIN_VALUE to the end of list to be as the initial index for the variable first ,second and third you cad replace it with 0 if you need but it will never work with negative number then

Max Heap data structure is your friend:

public static void main(String[] args) {
char[] arr = { 'A', 'B', 'C', 'D', 'E', 'F' };
List<Character> sorted = sortAngGetTopThree(arr);
System.out.println("first largest is " + sorted.get(0));
System.out.println("second largest is " + sorted.get(1));
System.out.println("third largest is " + sorted.get(2));
}
public static List<Character> sortAngGetTopThree(char... arr) {
Map<Character, Integer> map = Map.of('A', 55, 'B', 45, 'C', 5, 'D', 35, 'E', 35, 'F', 1);
Comparator<Character> sortByValueAndLetterDesc = (one, two) -> {
int res = Integer.compare(map.get(two), map.get(one));  // sort by number desc first
return res == 0 ? Character.compare(one, two) : res;    // sort by letter asc second
};
Queue<Character> maxHeap = new PriorityQueue<>(sortByValueAndLetterDesc);
for (char ch : arr)
maxHeap.add(ch);
List<Character> res = new ArrayList<>(3);
for (int i = 0; i < 3 && !maxHeap.isEmpty(); i++)
res.add(maxHeap.remove());
return res;
}