C++ arrays question!

[ReputGlory1]

I have made my code to cout the average of the values without the k smallest and k highest. I have a question. Where it says "B' SKELOS" i want to make my code so it cout the average if it replaces the k highest and the k smallest values with their near values. Can you understand the question?

#include <iostream>
#include <algorithm>
#include <cmath>
#include <iomanip>

using namespace std;


bool fthinousa(float n1, float n2)
{                                
    return n1>n2;               
}

bool au3ousa(float n1, float n2)
{                              
    return n1<n2;             
}



int main()
{
    int n, k;

    cin >> n >> k;

    float b[n], result1 = 0.f, result2 = 0.f;

    float array2[(n-k)];
    float array3[(n-(2*k))];

    for (int i=0; i<n; i++)
    {
        cin >> b[i];
    }
        sort(b, b + n, au3ousa);

    for(int i=0; i<n-k; i++)
    {
        array2[i]=b[i+k];
    }
        sort(array2, array2 + (n-k), fthinousa);

    for(int i=0; i<n-k; i++)
    {
        array3[i]=array2[i+k];
    }

    for(int a = 0; a < (n-(2*k)); a++)
    {
        result1 += array3[a];
    }



    cout << setprecision(2) << fixed <<(result1 / (n-(k*2))) << endl << endl;


//
//B' SKELOS
//



    return 0;
}

[keskiverto]

Understand: no.
What are near values?

You say that you now compute average of a set from which outliers have been removed. Do you want to compute average for whole set, but only after modifying some elements?

[ReputGlory1]

the near=for ex. 1 is near to 2, to near to 3.... do you now understand?

[keskiverto]

Do you mean, should k=2, that array
1, 2, 3, 4, 5
is replaced with
2, 3, 3, 3, 4
?

However, sum of elements and thus average remains the same. (+k-k==0)

[ReputGlory1]

k=2

array={1,2,3,4,5,6,7,8,9,10}

arrayafter={3,3,3,4,5,6,7,10,10,10}

[keskiverto]

std::sort( array, array+n );
auto sum = std::accumulate( array+k, array+n-k, 0 );
sum += k * (array[k] + array[n-k-1]);
auto avg = static_cast<double>( sum ) / n;