Задані два масиви  A(N) і B(N) . Підрахувати в них кількість елементів, великих значення T і першим на друк вивести масив, що має найменшу їх кількість

написати код на C++

#include <iostream>
using namespace std;

int main() {
    int N, T;
    cin >> N >> T;

    int A[N], B[N];
    int countA = 0, countB = 0;

    for (int i = 0; i < N; i++) {
        cin >> A[i];
        if (A[i] > T) {
            countA++;
        }
    }

    for (int i = 0; i < N; i++) {
        cin >> B[i];
        if (B[i] > T) {
            countB++;
        }
    }

    if (countA < countB) {
        cout << "Array A has the smallest number of elements greater than T." << endl;
    } else if (countB < countA) {
        cout << "Array B has the smallest number of elements greater than T." << endl;
    } else {
        cout << "Both arrays have the same number of elements greater than T." << endl;
    }

    return 0;
}

This code takes in the size of the arrays and the value of T as input, then initializes two arrays A and B. It then uses two variables, countA and countB, to keep track of the number of elements in each array that are greater than T. It then compares the two counts and prints out which array has the smallest count (or if they are equal).

а чому не вивівся масив?

The code I provided only compares the number of elements in each array that are greater than T and prints out which array has the smallest count (or if they are equal). It does not print out the entire array. If you also want to print out the entire array, you can add additional lines of code to do so, for example:

cout << "Array A: ";
for (int i = 0; i < N; i++) {
    cout << A[i] << " ";
}
cout << endl;

cout << "Array B: ";
for (int i = 0; i < N; i++) {
    cout << B[i] << " ";
}
cout << endl;

You can also add conditional statements to print out only the elements in the array that are greater than T.

вбудуй даний участок коду в попередній зразок

#include <iostream>
using namespace std;

int main() {
    int N, T;
    cin >> N >> T;

    int A[N], B[N];
    int countA = 0, countB = 0;

    for (int i = 0; i < N; i++) {
        cin >> A[i];
        if (A[i] > T) {
            countA++;
        }
    }

    for (int i = 0; i < N; i++) {
        cin >> B[i];
        if (B[i] > T) {
            countB++;
        }
    }

    if (countA < countB) {
        cout << "Array A has the smallest number of elements greater than T." << endl;
        cout << "Array A: ";
        for (int i = 0; i < N; i++) {
            cout << A[i] << " ";
        }
        cout << endl;
    } else if (countB < countA) {
        cout << "Array B has the smallest number of elements greater than T." << endl;
        cout << "Array B: ";
        for (int i = 0; i < N; i++) {
            cout << B[i] << " ";
        }
        cout << endl;
    } else {
        cout << "Both arrays have the same number of elements greater than T." << endl;
        cout << "Array A: ";
        for (int i = 0; i < N; i++) {
            cout << A[i] << " ";
        }
        cout << endl;
        cout << "Array B: ";
        for (int i = 0; i < N; i++) {
            cout << B[i] << " ";
        }
        cout << endl;
    }

    return 0;
}

You are correct, variable-length arrays (VLAs) are a feature of C99 and not C++. C++ does not support VLAs. Instead, in C++, you can use standard container classes such as std::vector to dynamically allocate memory for an array.