#include <iostream>
using namespace std;

void enterArray(int *arr,int n);
void printArray(int *arr, int n);
void sortbyOrder(int *x, int *y, int n);
int findIndexOfElement(int *arr,int n, int elementToFind);

void main()
{
    int n;
    cout << "Enter the size of array: n = ";
    cin >> n;
    int *x = new int[n];
    int *y = new int[n];

    cout << "Enter the array of X: ";
    enterArray(x, n);
    cout << "Enter the array of Y: ";
    enterArray(y, n);
    sortbyOrder(x, y, n);
    cout << "After sorting: " << endl;
    printArray(x, n);
    printArray(y, n);
    cout << endl;
    cout << findIndexOfElement(x, n, 5) << endl;
    delete []x;
    delete []y;
    system ("pause");
}

void enterArray(int *arr, int n)
{
    for (int i = 0; i < n; i++)
    {
        cin >> arr[i];
    }
}

void printArray(int *arr, int n)
{
    for (int i = 0; i < n; i++)
    {
        cout << arr[i] << " ";
    }
    cout << endl;
}

void sortbyOrder(int *x, int *y, int n)
{
    for (int i = 0; i < n-1; i++)
        for (int j = i+1; j < n; j++)
        {
            if (x[i] < x[j])
            {
                int tmp = x[i];
                x[i] = x[j];
                x[j] = tmp;

                tmp = y[i];
                y[i] = y[j];
                y[j] = tmp;
            }
        }
}

int findIndexOfElement(int *arr, int n, int elementToFind)
{
    int index=-1;
    for (int i = 0; i < n; i++)
    {
        if (arr[i] == elementToFind)
        {
            index = 1;
            break;
        }
    }
    return index;
}