#include <vector>
#include <algorithm>
#include <cstdlib>
#include <ctime>
#include <chrono>
#include <iostream>

using calctime_t = std::chrono::duration<long long, std::ratio<1, 10000000> >;

int main(int argc, char const *argv[])
{
    srand(time(NULL));
    int count = 1000000;
    std::vector<int64_t> vec(count);
    for (int i = 0; i < count; ++i)
    {
        vec[i] = (rand() % 2000) - 1000;
    }
    auto start = std::chrono::steady_clock::now();

    std::sort(vec.begin(), vec.end());

    auto end = std::chrono::steady_clock::now();

    for (int i = 0; i < count; ++i)
    {
        std::cout << vec[i];
    }

    calctime_t mtime = std::chrono::duration_cast<calctime_t>(end - start);

    std::cout << std::endl;
    std::cout << "0.0" << mtime.count() << std::endl;

    return 0;
}