try lab 8

#include <iostream>
#include <vector>
#include <algorithm>

int main()
{
    using namespace std;
    int n;
    cout << "Enter n: " << endl;
    cin >> n;
    double** mas = new double* [n];
    for (int i = 0; i < n; i++)
        mas[i] = new double[n];
    for (int i = 0; i < n; i++)
        for (int j = 0; j < n; j++)
            mas[i][j] = 0;
    double sum = 0;
    double sum2 = -mas[0][0];
    int m = 0;
    vector <double> mas2(m);
    for (int i = 0; i < n; i++)
    {
        cout << endl;
        for (int j = 0; j < n; j++)
        {
            cout << mas[i][j] << " ";
        }
    }
    cout << endl;
    int k = 0;
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < n; j++)
        {
            if (((i <= j / 2) && (j >= n / 2) && (j - i >= n / 2)) || ((i >= n / 2) && (j >= n / 2) && (j - n + i + 1 >= n / 2)))
            {   //mas[j][i] = 1;
                mas2.insert(mas2.begin() + k, mas[i][j]);
                //mas2[k] = mas[j][i];
                sum += mas2[k];
                k++;
            }
        }
    }
    for (int i = 0; i < mas2.size() - 1; i++)
    {
        sort(mas2.begin(), mas2.end());
    }
    for (int i = 0; i < mas2.size(); i++)
    {
        for (int j = 0; j < mas2.size(); j++)
        {
        if (mas2[i] == mas2[j])
        {
            l++;
        }
        else
        {
    }