4(ПП)

using namespace std;
#include <iostream>
#include <omp.h>
int  find_min(int* a) {
    int min = a[0];
    for (int i = 1; i < 10; i++) {
        if (a[i] < min)
            min = a[i];
        return min;
           }
}
int find_max(int* b) {
    int max = b[0];
    for (int i = 1; i < 10; i++) {
        if (b[i] > b[0])
            max = b[i];
        return max;
    }
}
int main()
{
    int a[10];
    int b[10];
    for (int i = 0; i < 10; i++) {
        a[i] = i;
        b[i] = 2 - i;
    }
#pragma omp parallel num_threads(2)
    {
        if (omp_get_thread_num() == 0) {
            cout << "Min in a= " << find_min(a) << endl;
        }

        else cout << "Max in b= " << find_max(b) << endl;

    }
}