Sales by Match - HackerRank || HackerRank Sales by Match Solution

#include <stdio.h>

int main()
{
    int n, i, count = 0, j, temp;
    scanf("%d", &n);
    int array[n];
    for (i = 0; i < n; i++) scanf("%d", &array[i]);

    // *** Array sorting ****

    for (i = 0; i < n; i++)
    {
        for (j = i + 1; j < n; j++)
        {
            if (array[i] > array[j])
            {
                temp = array[i];
                array[i] = array[j];
                array[j] = temp;
            }
        }
    }
    for (i = 0; i < n - 1; i++)
    {
        if (i < n && array[i] == array[i + 1])
        {
            count++;
            i += 1;
        }
    }
    printf("%d\n", count);

    return 0;
}

#include <bits/stdc++.h>

using namespace std;

int main()
{
    int n, i, count = 0;
    cin >> n;
    int array[n];
    for (i = 0; i < n; i++) cin >> array[i];
    int s = sizeof(array) / sizeof(array[0]);
    sort(array, array + s);
    for (i = 0; i < n - 1; i++)
    {
        if (i < n && array[i] == array[i + 1])
        {
            count++;
            i += 1;
        }
    }
    cout << count << endl;

    return 0;
}

import java.util.Arrays;
import java.util.Scanner;

public class Sock_Merchant {
    public static void main(String[] args) {
        Scanner input = new Scanner(System.in);
        int n = input.nextInt();
        int[] array = new int[n];
        for (int i = 0; i < n; i++) array[i] = input.nextInt();
        Arrays.sort(array);
        int count = 0;
        for (int i = 0; i < n - 1; i++) {
            if (i < n && array[i] == array[i + 1]) {
                count++;
                i += 1;
            }
        }
        System.out.println(count);
    }
}