Help me please with the test number 3

import java.util.*;
import java.io.*;

public class p1656
{
    public static int reverse(int k, int N)
    {
        return N - k - 1;
    }

    public static point fun(int i, int j, int N, int function)
    {
        point p = new point();
        if (function == 1)
        {
            if (i != j)
            {
                p.i = reverse(j, N);
                p.j = reverse(i, N);
            } else
            {
                p.i = reverse(i, N);
                p.j = j;
            }
        } else if (function == 2)
        {
            if (i != j)
            {
                p.i = j;
                p.j = i;
            } else
            {
                p.i = i;
                p.j = reverse(j, N);
            }
        } else if (function == 3)
        {
            if (i != j)
            {
                p.i = reverse(i, N);
                p.j = reverse(j, N);
            } else
            {
                p.i = reverse(i, N);
                p.j = reverse(j, N);
            }
        }
        return p;
    }
    public static void main(String[] args)
    {
        Scanner in = new Scanner(System.in);

        int N = in.nextInt();

        int arr[] = new int[N * N];
        //{198, 186, 181, 190, 194, 194, 174, 188, 171, 198, 182, 171, 175, 184, 177, 200, 189, 185, 177, 171, 172, 180, 186, 188, 197};
        int[] out = new int[N * N];

        for (int i = 0; i < N * N; i++)
        {
            arr[i] = in.nextInt();
        }

        Arrays.sort(arr);

        /*for (int i = 0; i < N * N; i++)
            System.out.print(arr[i] + " ");
        System.out.println()*/;

        int po = 0;

        for (int j = 0; j < N / 2 ; j++)
        {
            for (int i = j; i < N / 2 + 1; i++)
            {
                // System.out.println("i = " + i + " j = " + j + " po = " + po);

                out[N * i + j] = arr[po++];
                point p = fun(i, j, N, 1);

                //System.out.println("i = " + p.i + " j = " + p.j + " po = " + po);

                out[N * p.i + p.j] = arr[po++];
                p = fun(i, j, N, 2);

                //System.out.println("i = " + p.i + " j = " + p.j + " po = " + po);

                out[N * p.i + p.j] = arr[po++];
                p = fun(i, j, N, 3);

                 //System.out.println("i = " + p.i + " j = " + p.j + " po = " + po);

                out[N * p.i + p.j] = arr[po++];

                if (i != j && i != N / 2 )
                {
                    int savei = i;
                    i = reverse(i, N);


                    // System.out.println("i = " + i + " j = " + j + " po = " + po);

                    out[N * i + j] = arr[po++];
                    p = fun(i, j, N, 1);

                     //System.out.println("i = " + p.i + " j = " + p.j + " po = " + po);

                    out[N * p.i + p.j] = arr[po++];
                    p = fun(i, j, N, 2);

                    // System.out.println("i = " + p.i + " j = " + p.j + " po = " + po);

                    out[N * p.i + p.j] = arr[po++];
                    p = fun(i, j, N, 3);

                    // System.out.println("i = " + p.i + " j = " + p.j + " po = " + po);

                    out[N * p.i + p.j] = arr[po++];

                    i = savei;
                }

            }
        }

        out[N / 2  * N + N / 2] = arr[po++];

        for (int i = 0; i < N; i++)
        {
            for (int j = 0; j < N; j++)
                System.out.format("%4d", out[i * N + j]);
            System.out.println();
        }
    }
}

class point
{
    int i, j;
}

Here is my code:

#include<iostream>
#include<algorithm>
using namespace std;
int main(){
    int n,i,a[90],ans[12][12]={0},z,x,y,j;
    cin>>n;
    for(i=0; i<n*n; i++)cin>>a[i];
    sort(a,a+n*n);
             z=n*n-1; x=n/2+1; y=x;
             ans[x][y]=a[z--];
             int p=1;
                      while(z>0){
                                 ans[x-p][y]=a[z--];
                                 ans[x+p][y]=a[z--];
                                 ans[x][y-p]=a[z--];
                                 ans[x][y+p]=a[z--];
                                 for(i=y-p; i<=y+p; i++)if(ans[x-p][i]==0)ans[x-p][i]=a[z--];
                                 for(i=y-p; i<=y+p; i++)if(ans[x+p][i]==0)ans[x+p][i]=a[z--];
                                 for(i=x-p; i<=x+p; i++)if(ans[i][y-p]==0)ans[i][y-p]=a[z--];
                                 for(i=x-p; i<=x+p; i++)if(ans[i][y+p]==0)ans[i][y+p]=a[z--];
                                 p++;
                                 }
                      for(i=1; i<=n; i++){for(j=1; j<=n; j++)cout<<ans[i][j]<<" "; cout<<endl;}
    return 0;}

Isn't test 1 the same as sample input?
What is test #1 anyway?

My program

# include <iostream>
using namespace std;
void Paryad(int x,int y,int a[100]);
void Tart(int x,int y,int a[100],int b[100]);
int main ()
{
 int n=0;
 cin>>n;
 int a[100],b[100],d[100];
 for (int i=1;i<=n*n;i++)
  cin>>a[i];
 Paryad(1,n*n,a);
 Tart(1,n*n,a,b);
 int k=1,y=3;
 while(k<=n*n)
 {
  Paryad(k,y+k-1,b);
  Tart(k,y+k-1,b,d);
  k=k+3;
 }
 int t=0,c[100][100];
 for (i=1;i<=n;i++)
  for(int j=1;j<=n;j++)
  {
   t=t+1;
   c[j][i]=d[t];
  }

 for (i=1;i<=n;i++)
 {
  for(int j=1;j<=n;j++)
   cout<<c[i][j]<<' ';
  cout<<endl;
 }
return 0;
}
void Paryad(int x,int y,int a[100])
{
 int y1=0;
 for (int i=x;i<=y; i++)
 {
  for (int j=i+1; j<=y; j++)
  {
   if (a[i]>a[j])
   {
    y1=a[i];
    a[i]=a[j];
    a[j]=y1;
   }
  }
 }
}
void Tart(int x,int y,int a[100],int b[100])
{
 int j=x-1,u=1;
 for(int i=x;i<=y;i++)
 {
  if(u==1)
  {
   j=j+1;
   b[j]=a[i];
   u=0;
  }
  else
  {
   b[y-j+x]=a[i];
   u=1;
  }
 }
}

Who take "Wrong Answer" on test 5 ???
What do you do with this problem?

0.015 sec - time
122 kb - memory

To solve it, i use -=> bubble sort x2 <=- Good luck!
P.S. It's my first Accepted in two last weeks, i'm feel so good now! xD

Please, repair problem description(russian)!

is there only one TALLES soldier or there can me more of them

this answer is right for input example?
170 170 170
175 180 170
175 175 175
thx!