Дан вещественный массив А[N]. Сформировать массив В[3] следующим образом:

#include "stdafx.h"
#include <iostream>
#include <math.h>
 
using namespace std;
 
int main()
{
    setlocale (LC_CTYPE, "Russian");
    cout<<"Введите размер массива;\n";
    const unsigned Size=0;
    double A[nSize];
    cout<<"Введите массив:\n";
    for(unsigned i=0;i<nSize;i++)
    {
        cout<<"A["<<i<<"]=";
        cin>>A[i];
    }
    double B[3];
    double dMax=A[0];
    for(unsigned i=1;i<nSize;i++)
        if(A[i]>dMax)dMax=A[i];
    B[0] = max(A,nSize);
    double dAvr=0;
    double average;
    int nCount=0;
    for(unsigned i=0;i<nSize;i++)
        if(A[i]>0)
        {
            dAvr+=A[i];
            nCount++;
        }
    dAvr/=nCount;
    B[1] = average(A,nSize);
    double dMin=A[0];
    for(unsigned i=1;i<nSize;i++)
        if(A[i]<dMin)dMin=A[i];
    B[2] = abs(min(A,nSize));
    for(unsigned i=0;i<3;i++)
    cout<<"B["<<i<<"]="<<B[i]<<endl;
    cout<<"B[3]=[B[0],B[1],B[2]]";
    system("pause");
    delete[] A,B;
    return 0;
}

#include <algorithm>
#include <iostream>
#include <iterator>
#include <numeric>
#include <vector>
#include <cmath>
 
int main()
{
    std::size_t vectorSize;
    std::cout << "Input the size of vector: ";
    std::cin >> vectorSize;
 
    std::vector <double> currentVector (vectorSize);
    std::cout << "Input " << vectorSize << " elements: " << std::endl;
    for (unsigned i = 0; i < vectorSize; i++)
        std::cin >> currentVector.at(i);
 
    unsigned positiveCounter(0);
    std::count_if(currentVector.begin(), currentVector.end(), [&positiveCounter] (double currentElement) -> bool {
        return positiveCounter += currentElement > 0 ? 1 : 0;
    });
    double positiveAverage(std::accumulate(currentVector.begin(), currentVector.end(), 0.0, [] (double tempSum, double currentElement) -> double {
        return tempSum += currentElement > 0 ? currentElement : 0;
    }) / positiveCounter);
    auto minimalAndMaximal(std::minmax_element(currentVector.begin(), currentVector.end()));
 
    std::vector <double> resultVector;
    resultVector.push_back(*minimalAndMaximal.second);
    resultVector.push_back(positiveAverage);
    resultVector.push_back(fabs(*minimalAndMaximal.first));
    std::cout << "Result vector: " << std::endl;
    std::copy(resultVector.begin(), resultVector.end(), std::ostream_iterator <double> (std::cout, " "));
 
    return 0;
}

#include <algorithm>
#include <iostream>
#include <cmath>
 
int main()
{
    std::size_t arraySize;
    std::cout << "Input the size of array: ";
    std::cin >> arraySize;
 
    double positiveSum(0);
    unsigned positiveCounter(0);
 
    double *firstArray = new double [arraySize];
    std::cout << "Input " << arraySize << " elements: " << std::endl;
    for (unsigned i = 0; i < arraySize; i++) {
        std::cin >> firstArray[i];
        positiveSum += firstArray[i] > 0 ? firstArray[i] : 0;
        positiveCounter += firstArray[i] > 0 ? 1 : 0;
    }
    auto minimalAndMaximal = std::minmax_element(firstArray, firstArray + arraySize);
 
    double resultArray[3] = {*minimalAndMaximal.second, positiveSum / positiveCounter, fabs(*minimalAndMaximal.first)};
    std::cout << "Result: " << std::endl;
    for (unsigned i = 0; i < 3; i++)
        std::cout << resultArray[i] << " ";
    delete [] firstArray;
 
    return 0;
}