t1.cpp

#include <bits/stdc++.h>
#include <semaphore.h>
using namespace std;
using namespace chrono;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define nl "\n"
#define maxe(a) (*max_element(a.begin(), a.end()))
#define mine(a) (*min_element(a.begin(), a.end()))
#define all(a) a.begin(), a.end()
#define lsb(n) (n & -n)
#define msb(n) (1LL << (63 - __builtin_clzll(n)))
#define nsb(n) (__builtin_popcountll(n))
#define len(n) (to_string(n).size())

ll N = 1e8, num_t;

sem_t sem;

void work(ll tid) {
    // ll s = 0;
    // for(ll i=tid; i<N; i+=num_t) {
    //     s += i;
    // }
}

void solve() {
    int i;
    cin >> num_t;

    sem_init(&sem, 0, 1);

    high_resolution_clock::time_point t1 = high_resolution_clock::now();

    // vector<thread> th;
    // for(i=0; i<num_t; i++) {
    //     th.push_back(thread(work, i));
    // }

    // for(i=0; i<num_t; i++) {
    //     th[i].join();
    // }

    int* arr = new int[N];
    for(i=0; i<N/10; i++) {
        arr[i] = i;
    }
    delete[] arr;

    // num_t = 1;
    // work(0);

    high_resolution_clock::time_point t2 = high_resolution_clock::now();
    auto duration = duration_cast<microseconds>(t2 - t1).count();

    cout << duration << nl;
}

int main() {
    ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    int t = 1;
    // cin >> t;
    for (int i = 0; i < t; i++) {
        solve();
    }
    return 0;
}