-
Notifications
You must be signed in to change notification settings - Fork 0
/
MinimumBribes.java
57 lines (47 loc) · 1.44 KB
/
MinimumBribes.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
package com.testingPreparation;
import java.io.*;
import java.math.*;
import java.security.*;
import java.text.*;
import java.util.*;
import java.util.concurrent.*;
import java.util.regex.*;
public class MinimumBribes {
// Complete the minimumBribes function below.
static void minimumBribes(int[] q) {
int count = 0, total = 0;
boolean flag = true;
for (int i = 0; i < q.length-1; i++) {
for(int j=i+1;j<q.length;j++)
{
if(q[i]>q[j]){
count++;
total=total+1;
}
}
if (count > 2) {
flag = false;
System.out.println("Too chaotic");
break;
}
count=0;
}
if (flag)
System.out.println(total);
}
private static final Scanner scanner = new Scanner(System.in);
public static void main(String[] args) {
int t = scanner.nextInt();
scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
for (int tItr = 0; tItr < t; tItr++) {
int n = scanner.nextInt();
scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
int[] q = new int[n];
for(int i = 0;i < n;i++) {
q[i] = scanner.nextInt();
}
minimumBribes(q);
}
scanner.close();
}
}