Вычислить сумму и количество положительных элементов массива

#include <iostream>
#include <ctime>
#include <cstdlib>
 
int main()
{
    const int N = 10, M = 15;
    int x[N], y[M];
 
    srand((unsigned int)time(0));
    for (int i = 0; i < N; ++i)
        x[i] = rand() % 100 - 50;
    for (int i = 0; i < M; ++i)
        y[i] = rand() % 100 - 50;
 
    std::cout << "X[]: ";
    for (int i = 0; i < N; ++i)
        std::cout << x[i] << " ";
    std::cout << "\nY[]: ";
    for (int i = 0; i < M; ++i)
        std::cout << y[i] << " ";
    std::cout << "\n\n";
 
    int s1 = 0, k1 = 0;
    for (int i = 0; i < N; ++i)
    {
        if (x[i] > 0)
        {
            s1 += x[i];
            ++k1;
        }
    }
 
    int s2 = 0, k2 = 0;
    for (int i = 0; i < M; ++i)
    {
        if (y[i] > 0)
        {
            s2 += y[i];
            ++k2;
        }
    }
 
    double z = (double)(s1 + s2) / (k1 * k2);
 
    std::cout << "S1 = " << s1 << "\nK1 = " << k1 << "\nS2 = " << s2 << "\nK2 = " << k2 << "\n\n"
        << "Z = " << z << std::endl;
 
    std::cin.get();
    return 0;
}

#include <iostream>
#include <random>
#include <algorithm>
#include <iterator>
#include <chrono>
#include <functional>
#include <numeric>
#include <iomanip>
 
int main()
{
    const int N = 10, M = 15;
    int x[N], y[M];
 
    std::default_random_engine dre;
    dre.seed(static_cast<unsigned long>(std::chrono::high_resolution_clock::now().time_since_epoch().count()));
    std::uniform_int_distribution<int> de(-50, 50);
 
    std::generate(std::begin(x), std::end(x), [&]() { return de(dre); });
    std::generate(std::begin(y), std::end(y), [&]() { return de(dre); });
 
    std::cout << "X[]: ";
    std::copy(std::begin(x), std::end(x), std::ostream_iterator<int>(std::cout, " "));
    std::cout << "\nY[]: ";
    std::copy(std::begin(y), std::end(y), std::ostream_iterator<int>(std::cout, " "));
    std::cout << "\n\n";
 
    int s1 = std::accumulate(std::begin(x), std::end(x), 0, [](int s, int x) { return (x > 0) ? s + x : s; });
    int k1 = std::count_if(std::begin(x), std::end(x), [](int x) { return x > 0; });
    int s2 = std::accumulate(std::begin(y), std::end(y), 0, [](int s, int x) { return (x > 0) ? s + x : s; });
    int k2 = std::count_if(std::begin(y), std::end(y), [](int x) { return x > 0; });
    double z = static_cast<double>(s1 + s2) / (k1 * k2);
 
    std::cout << "S1 = " << s1 << "\nK1 = " << k1 << "\nS2 = " << s2 << "\nK2 = " << k2 << "\n\n"
        << "Z = " << std::fixed << std::setprecision(3) << z << std::endl;
 
    std::cin.get();
    return 0;
}