Breaking the Records - HackerRank || HackerRank Breaking the Records Solution

#include <stdio.h>

int main()
{
    int n, i, max, min, max_count = 0, min_count = 0;
    scanf("%d", &n);
    int array[n];
    for (i = 0; i < n; i++) scanf("%d", &array[i]);
    max = array[0], min = array[0];
    for (i = 0; i < n; i++)
    {
        if (array[i] > max)
        {
            max = array[i];
            max_count++;
        }
        if (array[i] < min)
        {
            min = array[i];
            min_count++;
        }
    }
    printf("%d %d", max_count, min_count);

    return 0;
}

#include <bits/stdc++.h>

using namespace std;

int main()
{
    int n, i, min, max, min_count = 0, max_count = 0;
    cin >> n;
    int array[n];
    for (i = 0; i < n; i++) cin >> array[i];
    min = array[0], max = array[0];
    for (i = 0; i < n; i++)
    {
        if (array[i] < min)
        {
            min = array[i];
            min_count++;
        }
        if (array[i] > max)
        {
            max = array[i];
            max_count++;
        }
    }
    cout << max_count << " " << min_count << endl;

    return 0;
}

import java.util.Scanner;

public class Breaking_the_Records {
    public static void main(String[] args) {
        Scanner input = new Scanner(System.in);
        int n = input.nextInt(), i;
        int[] array = new int[n];
        for (i = 0; i < n; i++) {
            array[i] = input.nextInt();
        }
        int max = array[0], min = array[0], maxn = 0, minn = 0;
        for (i = 0; i < n; i++) {
            if (array[i] > max) {
                max = array[i];
                maxn++;
            }
            if (array[i] < min) {
                min = array[i];
                minn++;
            }
        }
        System.out.println(maxn + " " + minn);
    }
}