第十四届蓝桥杯集训——练习解题阶段(无序阶段)-ALGO-624 观星

#include <stdio.h>
void shuru(int[] ,int );
void paixucishu(int[] ,int );

int main(void)
{
	int n;
	scanf("%d",&n);
	int shu[n+1];
	shuru(shu,n);
	paixucishu(shu,n);
	return 0; 
}

void shuru(int shu[] ,int n)

{
	int i;
	for( i = 0 ; i < n ; i ++ )
	{
		scanf("%d",&shu[i]);
	}
}

void paixucishu(int shu[] ,int n)
{
	int i , j ,cishu = 0 ;
	int n_ = n ;
	while( n_ -- > 0 )
	{
		for( i = 0 ; i < n - 1 ; i ++ )
		{
			if( shu[i] > shu[i+1] )
			{
				int t = shu[i];
				shu[i] = shu[i+1];
				shu[i+1] = t;
				cishu ++ ;
			}
		}		
	}
	printf("%d\n",cishu);
}

#include<iostream>
const int maxn=505;
using namespace std;
int main()
{
	int n;int num=0;
	cin>>n;long long int a[maxn];
	for(int i=0;i<n;i++)
	{
		cin>>a[i];
	}
	for(int i=n-1;i>=0;i--)
	{
		for(int j=0;j<i;j++)
		{
			if(a[j]>a[j+1])
			{
				int temp=a[j];
				a[j]=a[j+1];
				a[j+1]=temp;
				num++;
			}
		}
	}
	cout<<num<<endl;
	return 0;
}

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


public class Main {

    static final int INF = 0x3f3f3f3f;
    static final long LNF = 0x3f3f3f3f3f3f3f3fL;

    public static void main(String[] args) throws IOException {
        initReader();
       int n=nextInt();
       int[]arr=new int[n];
       for(int i=0;i<n;i++){
           arr[i]=nextInt();
       }
       int count=0;
       for(int i=arr.length-1;i>0;i--){
           for(int j=0;j<i;j++){
               if(arr[j]>arr[j+1]){
                   int temp=arr[j];
                   arr[j]=arr[j+1];
                   arr[j+1]=temp;
                   count++;
               }
           }
       }
       pw.println(count);
        pw.close();
    }

    static BufferedReader reader;
    static StringTokenizer tokenizer;
    static PrintWriter pw;

    public static void initReader() throws IOException {
        reader = new BufferedReader(new InputStreamReader(System.in));
        tokenizer = new StringTokenizer("");
        pw = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));
    }

    public static boolean hasNext() {
        try {
            while (!tokenizer.hasMoreTokens()) {
                tokenizer = new StringTokenizer(reader.readLine());
            }
        } catch (Exception e) {
            return false;
        }
        return true;
    }

    public static String next() throws IOException {
        while (!tokenizer.hasMoreTokens()) {
            tokenizer = new StringTokenizer(reader.readLine());
        }
        return tokenizer.nextToken();
    }

    public static String nextLine() {
        try {
            return reader.readLine();
        } catch (Exception e) {
            return null;
        }
    }

    public static int nextInt() throws IOException {
        return Integer.parseInt(next());
    }

    public static long nextLong() throws IOException {
        return Long.parseLong(next());
    }

    public static double nextDouble() throws IOException {
        return Double.parseDouble(next());
    }

    public static char nextChar() throws IOException {
        return next().charAt(0);
    }
}

n = int(input())
num = list(map(int,input().strip().split()))
count = 0


for i in range(n):
    for j in range(0,n-i-1):
        if num[j]>num[j+1]:
            temp = num[j]
            num[j] = num[j+1]
            num[j+1] = temp
            count += 1
print(count)