Cod sursa(job #2669953)

Utilizator teochess2017Togan Teodor-Bogdan teochess2017 Data 8 noiembrie 2020 15:26:37
Problema Statistici de ordine Scor 70
Compilator c-64 Status done
Runda Arhiva educationala Marime 0.89 kb
#include <stdio.h>
#include <stdlib.h>

int v[3000000];

void quickselect(int pmin, int pmax, int poz){
  int b, e, aux, p;
  p = v[(pmin + pmax) / 2];
  b = pmin;
  e = pmax;
  while(v[b] < p){
    b++;
  }
  while(v[e] > p){
    e--;
  }
  while(b < e){
    aux = v[b];
    v[b] = v[e];
    v[e] = aux;
    do{
      b++;
    }while(v[b] < p);
    do{
      e--;
    }while(v[e] > p);
  }
  if((poz <= e) && (pmin < e)){
    quickselect(pmin, e, poz);
  }else if((e + 1) < pmax){
    quickselect(e + 1, pmax, poz);
  }
}

int main()
{
    FILE *fin, *fout;
    int n, k, i;
    fin = fopen("sdo.in", "r");
    fscanf(fin, "%d%d", &n, &k);
    for(i = 0; i < n; i++){
      fscanf(fin, "%d", &v[i]);
    }
    fclose(fin);
    quickselect(0, n - 1, k - 1);
    fout = fopen("sdo.out", "w");
    fprintf(fout, "%d", v[k - 1]);
    fclose(fout);
    return 0;
}