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 Solution {
// Complete the minimumSwaps function below.
static int minimumSwaps(int[] arr) {
int count = 0;
List<Integer> swapIndex = new ArrayList<>();
for (int index = 0; index < arr.length; index++) {
for (int i = 1; i < arr.length; i++) {
if (swapIndex.size() == 2) {
int temp = arr[swapIndex.get(0)];
arr[swapIndex.get(0)] = arr[swapIndex.get(1)];
arr[swapIndex.get(1)] = temp;
count++;
swapIndex.clear();
break;
}
if (arr[i - 1] > arr[i]) {
swapIndex.add(i - 1);
}
}
}
return count;
}
private static final Scanner scanner = new Scanner(System.in);
public static void main(String[] args) throws IOException {
BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter(System.getenv("OUTPUT_PATH")));
int n = scanner.nextInt();
scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
int[] arr = new int[n];
String[] arrItems = scanner.nextLine().split(" ");
scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
for (int i = 0; i < n; i++) {
int arrItem = Integer.parseInt(arrItems[i]);
arr[i] = arrItem;
}
int res = minimumSwaps(arr);
bufferedWriter.write(String.valueOf(res));
bufferedWriter.newLine();
bufferedWriter.close();
scanner.close();
}
}
|