#include <iostream>
#include <vector>
#include <algorithm>
#include <cstdlib>
#include <ctime>
#include <omp.h>


void merge(std::vector<int>& a, int p, int m, int r) {
  
    int i, j, k;
    int n1 = m - p + 1;
    int n2 = r - m;
    
    std::vector<int> L(n1);
    std::vector<int> R(n2);
    
    #pragma omp parallel for
    for (i = 0; i < n1; i++) {
        L[i] = a[p + i];
    }
    #pragma omp parallel for
    for (j = 0; j < n2; j++) {
        R[j] = a[m + 1 + j];
    }
    
    i = 0;
    j = 0;
    k = p;
    
    #pragma omp parallel while
    while (i < n1 && j < n2) {
        if (L[i] <= R[j]) {
            a[k] = L[i];
            i++;
        }
        else {
            a[k] = R[j];
            j++;
        }
        k++;
    }
    #pragma omp parallel while
    while (i < n1) {
        a[k] = L[i];
        i++;
        k++;
    }
    
    while (j < n2) {
        a[k] = R[j];
        j++;
        k++;
    }
}

void mergesort(std::vector<int>& a, int p, int r) {
  
    if (p < r) {
        int m = (p + r) / 2;
        mergesort(a, p, m);
        mergesort(a, m + 1, r);
        merge(a, p, m, r);
    }
}

int main() {
    std::vector<int> a;
    srand(time(0));
    #pragma omp parallel for
    for (int i = 0; i < 300000; i++) {
        int random_number = rand() % 30000000 + 1;
        if (std::find(a.begin(), a.end(), random_number) == a.end()) {
            a.push_back(random_number);
        }
    }
    
    int n = a.size();
    mergesort(a, 0, n - 1);
    
    for (int i = 0; i < n; i++) {
        std::cout << a[i] << " ";
    }
    return 0;
}