C++ :

#include <bits/stdc++.h>
using namespace std;

int main() {
	int a[1010],n,i,js = INT_MIN,os = INT_MIN;
	cin>>n;
	
	for(i = 0;i < n;i++){
		cin>>a[i];
		
		if(a[i]%2==0&&a[i]>os){
			os = a[i];
		}
		
		if(a[i]%2==1&&a[i]>js){
			js = a[i];
		}
	}
	
	sort(a,a+n);
	
	cout<<js<<" "<<os<<endl;
	for(i = 0;i < n;i++){
		cout<<a[i];
		
		if(i != n - 1){
			cout<<" ";
		}
	}
}

Pascal :

var a:array[1..100000] of longint;
   n,i,j,t:longint;
begin
read(n);
for i:=1 to n do
read(a[i]);
for i:=1 to n do
for j:=i+1 to n do
if a[j]<a[i] then begin t:=a[i];a[i]:=a[j];a[j]:=t;end;
for i:=n downto 1 do
if a[i] mod 2=1 then begin write(a[i],' ');break;end;
for i:=n downto 1 do
if a[i] mod 2=0 then begin writeln(a[i]);break;end;
for i:=1 to n do
write(a[i],' ');
end.

Java :

import java.util.Scanner;
public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int num1 = scanner.nextInt();
//        int num2 = scanner.nextInt();
        int[] a = new int[num1];
        double s = 0,avg,x = 0;
        for (int i = 0; i < num1; i++) {
            a[i] = scanner.nextInt();
        }
        int max1 = 0;
        int max2 = 1;
        for (int i = 0; i < num1; i++) {
            if(a[i] % 2 == 0){
                if(max1 < a[i])max1 = a[i];
            }else if(max2 < a[i])max2 = a[i];
        }
        paiXu(a);
        System.out.println(max2 + " " + max1);
        for (int i = 0; i < num1; i++) {
            System.out.print(a[i] + " ");
        }
    }

    public static boolean judge(int i,int j){
        int a,s = 0;
        while(i != 0){
            a = i % 10;
            s = s + a;
            i /= 10;
        }
        if(s == j)return true;
        else return false;
    }

    public static void paiXu(int[] a){
        int temp;
        for(int i = 0;i < a.length - 1;i++){
            for(int k = 0;k < a.length - i - 1;k++){
                if(a[k] > a[k + 1]){
                    temp = a[k];
                    a[k] = a[k + 1];
                    a[k + 1] = temp;
                }
            }
        }
    }

    public static int MAX(int[] a){
        int max = a[0];
        for (int i = 0; i < a.length; i++) {
            if(max < a[i]){
                max = a[i];
            }
        }
        return max;
    }

    public static int MIN(int[] a){
        int min = a[0];
        for (int i = 0; i < a.length; i++) {
            if(min > a[i]){
               min = a[i];
            }
        }
        return min;
    }
}

Python :

n=int(input())
a=input().split()
a=list(map(int,a))
da1=0
da2=0
for i in range(n):
    if(a[i]%2!=0):
        if(a[i]>da1):
            da1=a[i]
    else:
        if(a[i]>da2):
            da2=a[i]
print(da1,da2)
a=sorted(a)
for i in a:
    print(i,end=" ")