к наибольший

#include <iostream>
#include <cmath>
#include <stdio.h>
using namespace std;

void sift (int *arr, int first, int last)

 {
  int j = first;
  int k = first*2+1;

  while (k <= last)
  {
    if (k < last && arr[k+1] < arr[k])
     k++;
     if (arr[j] < arr[k])
     break;
     else if (arr[j] >= arr[k])
     {
        swap(arr[j], arr[k]);
         j = k;
         k = k*2+1;
     }
 }
}

void sort (int *arr, int razmer)
{
  for (int i = razmer/2-1; i >= 0; i--)
   sift (arr, i, razmer-1);
}

int main()
{
  int n = 0, k = 0, znach = 0, x = 1, shetchik = 0;

  scanf("%d", &n);
  scanf("%d", &k);

  int *result = new int[k];

for (int i = 0; i<k; i++)
  {
    scanf("%d", &znach);
    result[i] = znach;
  }

sort (result, k);

 for (int i = k; i < n; i++)
  {
   scanf("%d", &znach); // вводим значение

    if (result[0] < znach)
      {
        result[0] = znach;
        sift (result, 0, k-1);
      }
  }

printf ("%d", result[0]);
}