Sorting books

#include <iostream>
#include <vector>
#include <cmath>
#include <bits/stdc++.h>

using namespace std;

int sum_in_area(int y1, int x1, int y2, int x2, vector<vector<int>> forest)
{
    int sum = 0;
    sum += forest[x2][y2];
    sum -= forest[x1 - 1][y2];
    sum -= forest[x2][y1 - 1];
    sum += forest[x1 - 1][y1 - 1];
    return sum;
}

inline void construct(const int &end, const int &line, const int &value, vector<vector<int>> & forest)
{
    
}

void add(int k, int x, vector<int> & tree)
{
    int n = tree.size() / 2;
    k += n;
    tree[k] = x;
    for (k /= 2; k >= 1; k /= 2)
    {
        tree[k] = tree[2*k] + tree[2*k+1];
    }
}


int main()
{
    int n_numbers;
    cin >> n_numbers;

    vector<tuple<int, int, int>> values;
    vector<pair<int, int>> values_sorted;

    for(int l = 0; l < n_numbers; ++l)
    {
        int temp;
        
        cin >> temp;
        values.push_back({temp, 0, 0});
        values_sorted.push_back({temp, l});
    }

    sort(values_sorted.begin(), values_sorted.end());
    

    for(int i = 0; i < n_numbers; ++i)
    {
        int original_pos = values_sorted[i].second;
        get<1>(values[original_pos]) = i;
        get<2>(values[original_pos]) = i - original_pos;
    }

    for(int i = 0; i < n_numbers; ++i)
    {
        int diff_sorted_pos = get<2>(values[i]);
        if(diff_sorted_pos > 0) // Sorted pos after current pos
        {
            int n_below = 0;
            int n_above = 0;
            for(int a = 0; a < i; ++a)
            {
                if(values[a] > values[i]) n_above++;
            }
            for(int a = i + 1; a < n_numbers; ++a)
            {
                if(values[a] < values[i]) n_below++;
            }
            get<2>(values[i]) = abs(get<2>(values[i])) + 2 * n_above;
            // if(abs(diff_sorted_pos) < n_below) get<2>(values[i]) += 2 * abs(abs(diff_sorted_pos) - n_below);
        }
        else if(diff_sorted_pos < 0) // Sorted pos before current pos
        {
            int n_below = 0;
            int n_above = 0;
            for(int a = 0; a < i; ++a)
            {
                if(values[a] > values[i]) n_above++;
            }
            for(int a = i + 1; a < n_numbers; ++a)
            {
                if(values[a] < values[i]) n_below++;
            }
            get<2>(values[i]) = abs(get<2>(values[i])) + 2 * n_below;
            // if(abs(diff_sorted_pos) < n_above) get<2>(values[i]) += 2 * abs(abs(diff_sorted_pos) - n_above);
        }
        else
        {
            int n_below = 0;
            int n_above = 0;
            for(int a = 0; a < i; ++a)
            {
                if(values[a] > values[i]) n_above++;
            }
            for(int a = i + 1; a < n_numbers; ++a)
            {
                if(values[a] < values[i]) n_below++;
            }
            get<2>(values[i]) = abs(get<2>(values[i])) + 2 * n_below + 2 * n_above;
        }
    }

    int sum = 0;
    for(int i = 0; i < n_numbers; ++i)
    {
        sum += get<2>(values[i]);
    }
 
    cout << sum/2 << endl;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: WRONG ANSWER

Test 11

Verdict: ACCEPTED

Test 12

Verdict: WRONG ANSWER

Test 13

Verdict: WRONG ANSWER

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: ACCEPTED

Test 17

Verdict: ACCEPTED

Test 18

Verdict: ACCEPTED

Test 19

Verdict: ACCEPTED

Test 20

Verdict: ACCEPTED

Test 21

Verdict: WRONG ANSWER

Test 22

Verdict: ACCEPTED

Test 23

Verdict: WRONG ANSWER

Test 24

Verdict: ACCEPTED

Test 25

Verdict: ACCEPTED

Test 26

Verdict: ACCEPTED

Test 27

Verdict: WRONG ANSWER

Test 28

Verdict: WRONG ANSWER

Test 29

Verdict: ACCEPTED

Test 30

Verdict: ACCEPTED

Test 31

Verdict: ACCEPTED

Test 32

Verdict: WRONG ANSWER

Test 33

Verdict: ACCEPTED

Test 34

Verdict: WRONG ANSWER

Test 35

Verdict: ACCEPTED

Test 36

Verdict: ACCEPTED

Test 37

Verdict: WRONG ANSWER

Test 38

Verdict: ACCEPTED

Test 39

Verdict: ACCEPTED

Test 40

Verdict: ACCEPTED

Test 41

Verdict: ACCEPTED

Test 42

Verdict: WRONG ANSWER

Test 43

Verdict: ACCEPTED

Test 44

Verdict: WRONG ANSWER

Test 45

Verdict: WRONG ANSWER

Test 46

Verdict: WRONG ANSWER

Test 47

Verdict: WRONG ANSWER

Test 48

Verdict: ACCEPTED

Test 49

Verdict: WRONG ANSWER

Test 50

Verdict: ACCEPTED

Test 51

Verdict: ACCEPTED

Test 52

Verdict: ACCEPTED

Test 53

Verdict: WRONG ANSWER

Test 54

Verdict: WRONG ANSWER

Test 55

Verdict: WRONG ANSWER

Test 56

Verdict: WRONG ANSWER

Test 57

Verdict: WRONG ANSWER

Test 58

Verdict: ACCEPTED

Test 59

Verdict: WRONG ANSWER

Test 60

Verdict: WRONG ANSWER

Test 61

Verdict: TIME LIMIT EXCEEDED

Test 62

Verdict: TIME LIMIT EXCEEDED

Test 63

Verdict: TIME LIMIT EXCEEDED

Test 64

Verdict: TIME LIMIT EXCEEDED

Test 65

Verdict: TIME LIMIT EXCEEDED

Test 66

Verdict: TIME LIMIT EXCEEDED

Test 67

Verdict: TIME LIMIT EXCEEDED

Test 68

Verdict: TIME LIMIT EXCEEDED

Test 69

Verdict: TIME LIMIT EXCEEDED

Test 70

Verdict: TIME LIMIT EXCEEDED

Test 71

Verdict: TIME LIMIT EXCEEDED