-
Notifications
You must be signed in to change notification settings - Fork 0
/
Sort_In_Specific_Order.java
68 lines (68 loc) · 1.29 KB
/
Sort_In_Specific_Order.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
package rank;
import java.util.*;
public class Sort_In_Specific_Order
{
public static void main (String[] args) {
Scanner sc=new Scanner(System.in);
int t=sc.nextInt();
while(t-- >0)
{
int n=sc.nextInt();
int n1,n2;
if(n%2==0)
{
n1=n/2;
n2=n/2;
}
else
{
n1=(n/2)+1;
n2=n-n1;
}
int b[]=new int[n1];
int c[]=new int[n2];
int a[]=new int[n];
for(int i=0;i<n;i++)
{
a[i]=sc.nextInt();
}
int j=0,k=0;
for(int i=0;i<n;i++)
{
if(a[i]%2!=0)
{
b[j]=a[i];
j++;
}
else
{
c[k]=a[i];
k++;
}
}
Arrays.sort(c);
int tmp=0;
for(int i=0;i<n1;i++)
{
for(int l=i+1;l<n1;l++)
{
if(b[i]<b[l])
{
tmp=b[l];
b[l]=b[i];
b[i]=tmp;
}
}
}
for(int i=0;i<n1;i++)
{
System.out.print(b[i]+" ");
}
for(int i=0;i<n2;i++)
{
System.out.print(c[i]+" ");
}
System.out.println();
}
}
}