C++ :

#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
	int n;
	cin>>n;
	int a[n+10];
	for(int i=1;i<=n;++i)
	{
		cin>>a[i];
	}
	int x,y;
	cin>>x>>y;
	
	sort(a+1,a+n+1);
	
	printf("%d ",a[n-x+1]);
	printf("%d",a[y]);
	return 0;
	
	
}

Pascal :

var
  n,x,y,i,j,k:longint;
  a:array[1..100] of longint;
begin
  readln(n);
  for i:=1 to n do read(a[i]);
  readln(x,y);
  for i:=1 to n-1 do
  for j:=i+1 to n do
  if a[i]>a[j] then
  begin
    k:=a[i];
    a[i]:=a[j];
    a[j]:=k;
  end;
  writeln(a[n-x+1],' ',a[y]);
end.