/*#include <stdio.h>

int main()
{
    int n;
    printf("Enter the length of the array: ");
    scanf("%d", &n);

    int a[n];
    printf("Enter the array elements in ascending order:\n");
    for (int i = 0; i < n; i++)
    {
        scanf("%d", &a[i]);
    }

    int max_site_start = 0;
    int max_site_length = 1;
    int current_site_start = 0;
    int current_site_length = 1;

    for (int i = 1; i < n; i++)
    {
        if (a[i] == a[i-1])
        {
            current_site_length++;
        } else
        {
            if (current_site_length > max_site_length)
            {
                max_site_start = current_site_start;
                max_site_length = current_site_length;
            }
            current_site_start = i;
            current_site_length = 1;
        }
    }

    if (current_site_length > max_site_length)
    {
        max_site_start = current_site_start;
        max_site_length = current_site_length;
    }

    printf("The longest playground starts at index %d and has length %d.\n",
           max_site_start, max_site_length);

    return 0;
}*/



/*#include <stdio.h>

int main()
{
    int n;
    printf("Enter the length of the sequence: ");
    scanf("%d", &n);

    int a[n];
    printf("Enter the sequence elements: ");
    for (int i = 0; i < n; i++)
    {
        scanf("%d", &a[i]);
    }

    int valid = 1;
    for (int i = 0; i < n-1; i+=2)
    {
        if (i+1 >= n || a[i] >= a[i+1])
        {
            valid = 0;
            break;
        }
        if (i+2 < n && a[i+1] <= a[i+2])
        {
            valid = 0;
            break;
        }
    }

    if (valid)
    {
        printf("The sequence satisfies the condition.");
    } else {
        printf("The sequence does not satisfy the condition.");
    }

    return 0;
}*/




/*#include <stdio.h>

int main()
{
    int arr[] = {1, 2, 3, 4, 5};
    int n = sizeof(arr) / sizeof(arr[0]);

    printf("Original array: ");
    for(int i=0; i<n; i++)
    {
        printf("%d ", arr[i]);
    }

    printf("\nReversed array: ");
    for(int i=n-1; i>=0; i--)
    {
        printf("%d ", arr[i]);
    }

    return 0;
}*/




/*#include <stdio.h>

int main()
{
    int n, k;
    printf("Enter the length of the sequence: ");
    scanf("%d", &n);

    int arr[n];
    printf("Enter %d integers:\n", n);
    for(int i=0; i<n; i++)
    {
        scanf("%d", &arr[i]);
    }

    printf("Enter the number of positions to move: ");
    scanf("%d", &k);

    for(int i=0; i<k; i++)
    {
        int temp = arr[0];
        for(int j=0; j<n-1; j++)
        {
            arr[j] = arr[j+1];
        }
        arr[n-1] = temp;
    }

    printf("Sequence after moving %d positions:\n", k);
    for(int i=0; i<n; i++)
    {
        printf("%d ", arr[i]);
    }

    return 0;
}*/




#include <stdio.h>

void bubble_sort(int arr[], int n);

int main()
{
    int n, k;
    printf("Enter the length of the sequence: ");
    scanf("%d", &n);

    int arr[n];
    printf("Enter %d integers:\n", n);
    for(int i=0; i<n; i++)
    {
        scanf("%d", &arr[i]);
    }

    printf("Enter the value of K: ");
    scanf("%d", &k);

    bubble_sort(arr, n);

    printf("The %dth largest element in the sequence is %d.\n", k, arr[k-1]);

    return 0;
}

void bubble_sort(int arr[], int n)
{
    for(int i=0; i<n-1; i++)
    {
        for(int j=0; j<n-i-1; j++)
        {
            if(arr[j] < arr[j+1])
            {
                int temp = arr[j];
                arr[j] = arr[j+1];
                arr[j+1] = temp;
            }
        }
    }
}