Найти среднее арифметическое элементов массива без учёта максимального и минимального элементов

// Middle arithmetic without min and max elements of array.
#include <iostream>
int main()
{
    int n, a[n], min, max, summ, z;
    float mid;
    printf("Middle arithmetic without min and max elements of array.\n");
    printf("Input quantity of elements in array: ");
    std::cin>>n;
    printf("Input an array: \n");
    for(int i=0; i<n; i++)
    {
        printf("n[%i] -> ", i);
        std::cin>>a[i];
//      summ += a[i];
        if(a[i] != 0) z++;      
        
    }
    for (int j=0; j<n; j++)
    {
        summ += a[j];
        if(a[j] > max ) max = a[j];
        if(a[j]< min ) min = a[j];
    }       
    printf("\nSumm of elements is %i.\n", summ);
//  summ -= min;
    summ -= max;
    mid = summ / (n-2);
    printf("\nEntered array: ");
    for  ( int l = 0; l<n; l++)
        printf("%i ", a[l]);    
//  printf("\nMinimum element is %i.\n", min);
    printf("Maximum elenent is %i.\n", max);
 
    printf("Numbers that are bigger then 0: %i\n", z);
    printf("\nMiddle atithmetic without min and max: %.3f", mid);
 
    std::cin.get();
    return 0;
}

Process exited after 0.0179 seconds with return value 3221225725

#include <iostream>
#include <vector>
#include <algorithm>
 
int main(int argc, char ** argv)
{
  std::vector<int> v {1, 2, 3, 4, 5, 6, 7, 8, 9};
  
  int sum = std::accumulate(v.begin(), v.end(), 0);
  int min = *(std::min_element(v.begin(), v.end() ));
  int max = *(std::max_element(v.begin(), v.end()));
 
  sum -= min - max;
 
  std::cout << "sum = " << ((double) sum) / v.size() << std::endl;
  std::cout << "min = " << min << std::endl;
  std::cout << "max = " << max << std::endl;
 
  return 0;
}

#include <iostream>
#include <vector>
#include <algorithm>
 
int main(int argc, char ** argv)
{
  std::vector<int> v {1, 2, 3, 4, 5, 6, 7, 8, 9};
  
  int sum = std::accumulate(v.begin(), v.end(), 0);
  auto minmax = std::minmax_element(v.begin(), v.end());
 
  sum -= *minmax.first - *minmax.second;
 
  std::cout << "sum = " << ((double) sum) / v.size() << std::endl;
  std::cout << "min = " << *minmax.first << std::endl;
  std::cout << "max = " << *minmax.second << std::endl;
 
  return 0;
}

printf("Input quantity of elements in array: ");
    std::cin>>n;

    
//  if(a[j]< min ) min = a[j];

// Middle arithmetic without min and max elements of array.
#include <iostream>
int main()
{
    const int n=5;
    int a[n], min, max, summ=0, z=0;
    float mid;
    //printf("Middle arithmetic without min and max elements of array.\n");
    //printf("Input quantity of elements in array: ");
    //std::cin>>n;
    printf("Input an array: \n");
    for(int i=0; i<n; i++)
    {
        printf("n[%i] -> ", i);
        std::cin>>a[i];
        if(a[i] > 0) z++;      
    }
    min=a[0];
    max=a[0];
    for (int j=0; j<n; j++)
    {
        summ += a[j];
        if(a[j] > max ) max = a[j];
        if(a[j]< min ) min = a[j];
    }       
    printf("\nSumm of elements is %i.\n", summ);
    summ -= min;
    summ -= max;
    mid = summ / (n-2);
    printf("\nEntered array: ");
    for  ( int l = 0; l<n; l++)
        printf("%i ", a[l]);    
    printf("\nMinimum element is %i.\n", min);
    printf("Maximum elenent is %i.\n", max);
 
    printf("Numbers that are bigger then 0: %i\n", z);
    printf("\nMiddle atithmetic without min and max: %.3f", mid);
 
    std::cin.get();
    return 0;
}

#include <iostream>
#include <vector>
#include <algorithm>
 
int main(int argc, char ** argv)
{
  std::vector<int> v {1, 2, 3, 4, 5, 6, 7, 8, 9};
  
  int sum = std::accumulate(v.begin(), v.end(), 0);
  auto minmax = std::minmax_element(v.begin(), v.end());
 
  sum -= *minmax.first + *minmax.second;
 
  std::cout << "sum = " << ((double) sum) / v.size() << std::endl;
  std::cout << "min = " << *minmax.first << std::endl;
  std::cout << "max = " << *minmax.second << std::endl;
 
  return 0;
}

int a[n], n,  min=2, max=0, summ=0, z;

int n, a[n],  min=2, max=0, summ=0, z;

const int n=5;

    int n;
    ...
    printf("Middle arithmetic without min and max elements of array.\n");
    printf("Input quantity of elements in array: ");
    std::cin>>n;
    printf("Input an array: \n");
    ...

int i;

int i=0;

// Middle atithmetic of array elements that are bigger then zero.
#include <iostream>
 
int main()
{
    int n, a[n], i, summ = 0, z;
    float mid;
    printf("Middle atithmetic of array elements that are bigger then zero.\n");
    printf("Input quantity of elements in array: ");
    std::cin>>n;
    printf("Input an array: \n");
    for( i; i<n; i++)
    {
        printf("a[%i] -> ", i);
        std::cin>>a[i];
        if(a[i] != 0) z++;
        summ += a[i];
    }
    mid = summ / n;
    printf("\nEntered array: ");
    for  ( int l = 0; l<n; l++)
        printf("%i ", a[l]);    
    printf("\nSumm of elements is %i.\n", summ);
    printf("\nNumbers that are bigger then 0: %i\n", z);
    printf("Middle atithmetic of array elements: %.3f", mid);
    std::cin.get();
    return 0;
}