Решение задачи c++

 #include <iostream> 
#include <cmath> 
 
bool isPrime(int num) { 
    if (num <= 1) return false; 
    for (int i = 2; i * i <= num; ++i) 
        if (num % i == 0) return false; 
    return true; 
} 
 
void sortByAbs(int arr[], int start, int end) { 
    for (int i = start; i < end; ++i) 
        for (int j = i + 1; j < end; ++j) 
            if (abs(arr[i]) > abs(arr[j])) 
                std::swap(arr[i], arr[j]); 
} 
 
int main() { 
    int arr[] = {10, 3, 7, 11, 13, 17, 23, 29, 5, 19}; 
    int n = sizeof(arr) / sizeof(arr[0]); 
    int primes[5], count = 0; 
 
    for (int i = 0; i < n && count < 5; ++i) 
        if (isPrime(arr[i])) 
            primes[count++] = i; 
 
    if (count < 5) { 
        std::cout << "Недостаточно простых чисел." << std::endl; 
        return 1; 
    } 
 
    sortByAbs(arr, primes[2] + 1, primes[4] + 1); 
 
    for (int i = 0; i < n; ++i) 
        std::cout << arr[i] << " "; 
    std::cout << std::endl; 
 
    return 0; 
}