Kyselyt

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

public class kyselyt2 {


	public static void main(String[] args) throws IOException {

		// Scanner input = new Scanner(System.in);
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		
		// String kokomaara =  input.nextLine();
		String[] parts = br.readLine().split(" ");
		
		// String[] kokomaaraParts = kokomaara.split("\\s+");
		
		int n = Integer.parseInt(parts[0]);
		int q = Integer.parseInt(parts[1]);
		
		// int t = Integer.parseInt(input.nextLine());
		
		int[] x = new int[n];  // luvut
		int[] a = new int[q];  // alku
		int[] b = new int[q];  // loppu
		
		String[] parts2 = br.readLine().split(" ");
		// String num =  input.nextLine();
		// String[] numParts = num.split("\\s+");
		
		for (int i = 0; i < n; i++) {
			x[i] = Integer.parseInt(parts2[i]);
		}

		// String[] rajat = new String[q]; // numerot

		for (int i = 0; i < q; i++) {
			
			String[] parts3 = br.readLine().split(" ");
			// rajat[i] =  input.nextLine();
			
			// String[] rajaParts = rajat[i].split("\\s+");
			a[i] = Integer.parseInt(parts3[0]);
			b[i] = Integer.parseInt(parts3[1]);
		}

		// input.close(); 
		
		// Program here

		StringBuilder sb = new StringBuilder();


		for (int i = 0; i < q; i++) {	 // tapaus q
		
			int ans = -1;
			int pit = b[i] - a[i] + 1;
			float suhde = 0.0f;

			int[] counts = new int[101];
			
			
			// Map<Integer, Integer> counts = new HashMap<>();

			for (int i2 = (a[i]-1); i2 <= (b[i]-1); i2++) {
				// counts.put(x[i2], counts.getOrDefault(x[i2], 0) + 1);
				counts[x[i2]]++;
			}

			int mostCommon = 0;
			int highestCount = 0;

		/*
			for (Map.Entry<Integer, Integer> entry : counts.entrySet()) {
				if (entry.getValue() > highestCount) {
					highestCount = entry.getValue();
					mostCommon = entry.getKey();
				}
			}
		*/
		
        for (int i3 = 1; i3 <= 100; i3++) {
            if (counts[i3] > highestCount) {
                highestCount = counts[i3];
                mostCommon = i3;
            }
        }

			suhde = (float)highestCount / pit;
			
			if (suhde > 0.5) {
				ans = mostCommon;
			}

			sb.append(ans).append('\n');

		}   // tapaus q



		// tulostus
		
		// System.out.println(dy + " " + dx);		

		System.out.print(sb.toString());

    }
}

Test 1

Group: 1, 2, 3, 4

Verdict: ACCEPTED

Test 2

Group: 1, 2, 3, 4

Verdict: ACCEPTED

Test 3

Group: 1, 3, 4

Verdict: ACCEPTED

Test 4

Group: 2, 3, 4

Verdict: TIME LIMIT EXCEEDED

Test 5

Group: 2, 3, 4

Verdict: TIME LIMIT EXCEEDED

Test 6

Group: 2, 3, 4

Verdict: TIME LIMIT EXCEEDED

Test 7

Group: 3, 4

Verdict: RUNTIME ERROR

Exception in thread "main" java.lang.ArrayIndexOutOfBoundsException: Index 110738261 out of bounds for length 101
	at kyselyt2.main(kyselyt2.java:66)

Test 8

Group: 4

Verdict: TIME LIMIT EXCEEDED

Test 9

Group: 4

Verdict: TIME LIMIT EXCEEDED

Test 10

Group: 4

Verdict: RUNTIME ERROR

Exception in thread "main" java.lang.ArrayIndexOutOfBoundsException: Index 633065655 out of bounds for length 101
	at kyselyt2.main(kyselyt2.java:66)

Test 11

Group: 3, 4

Verdict: RUNTIME ERROR

Exception in thread "main" java.lang.ArrayIndexOutOfBoundsException: Index 714932756 out of bounds for length 101
	at kyselyt2.main(kyselyt2.java:66)

Test 12

Group: 4

Verdict: RUNTIME ERROR

Exception in thread "main" java.lang.ArrayIndexOutOfBoundsException: Index 1000000000 out of bounds for length 101
	at kyselyt2.main(kyselyt2.java:66)

Test 13

Group: 3, 4

Verdict: RUNTIME ERROR

Exception in thread "main" java.lang.ArrayIndexOutOfBoundsException: Index 329574367 out of bounds for length 101
	at kyselyt2.main(kyselyt2.java:66)

Test 14

Group: 4

Verdict: RUNTIME ERROR

Exception in thread "main" java.lang.ArrayIndexOutOfBoundsException: Index 977467597 out of bounds for length 101
	at kyselyt2.main(kyselyt2.java:66)

Test 15

Group: 4

Verdict: RUNTIME ERROR

Exception in thread "main" java.lang.ArrayIndexOutOfBoundsException: Index 211070558 out of bounds for length 101
	at kyselyt2.main(kyselyt2.java:66)

Test 16

Group: 4

Verdict: TIME LIMIT EXCEEDED