Maximum Product

C code:

#include<stdio.h>
#include <stdlib.h>

int main()
{
int n,i,j,temp;
scanf("%d",&n);
int a[n];
for(i=0;i<n;i++)
{
    scanf("%d ",&a[i]);
}
for(i=0;i<n;i++)
{
    for(j=i+1;j<n;j++)
    {
        if(a[i]>a[j])
        {
            temp=a[i];
            a[i]=a[j];
            a[j]=temp;
        }
    }
}
if(a[0]*a[1]>a[n-1]*a[n-2])
{
    printf("%d %d",a[0],a[1]);
}
else
printf("%d %d",a[n-2],a[n-1]);
}

Java Code:

import java.util.*;
public class Hello {

    public static void main(String[] args) {
        Scanner s=new Scanner(System.in);
        int n=s.nextInt();
        int a[]=new int [n];
        int i,j,c=0;
        for(i=0;i<n;i++)
        a[i]=s.nextInt();
        Arrays.sort(a);
        if(a[0]*a[1]>a[n-1]*a[n-2])
        {
            System.out.print(a[0]+" "+a[1]);
        }
        else
        {
            System.out.print(a[n-2]+" "+a[n-1]);
        }
       
    }
}