Cod sursa(job #3005614)

Utilizator Mihai00700Lalallalalal Mihai00700 Data 17 martie 2023 09:36:33
Problema Statistici de ordine Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.33 kb
#include <fstream>
#include <cstdlib>
#include <ctime>

using namespace std;

const int N = 3e6;

int v[N];

void part3w(int v[], int st, int dr, int &p1, int &p2)
{
    int i = st;
    p1 = st;
    p2 = dr - 1;
    while (i <= p2)
    {
        if (v[i] < v[dr])
        {
            swap(v[i++], v[p1++]);
        }
        else if (v[i] > v[dr])
        {
            swap(v[i], v[p2--]);
        }
        else
        {
            i++;
        }
    }
    swap(v[dr], v[++p2]);
}

void qs3p(int v[], int st, int dr, int p)
{
    if (st == dr)
    {
        return;
    }
    int p1, p2;
    part3w(v, st, dr, p1, p2);
    if (st < p1 && p < p1)
    {
        qs3p(v, st, p1 - 1, p);
    }
    if (p2 < dr && p > p2)
    {
        qs3p(v, p2 + 1, dr, p);
    }
}

void shuffle(int v[], int n)
{
    srand(time(NULL));
    ///face ca la fiecare rulare sa fie amestecate altfel
    for (int i = n - 1; i > 0; i--)
    {
        int p = rand() % (i + 1);
        swap(v[i], v[p]);
    }
}

int main()
{
    ifstream in("sdo.in");
    ofstream out("sdo.out");
    int n, k;
    in >> n >> k;
    k--;
    for (int i = 0; i < n; i++)
    {
        in >> v[i];
    }
    shuffle(v, n);
    qs3p(v, 0, n - 1, k);
    out << v[k] << "\n";
    in.close();
    out.close();
    return 0;
}