37 lines
533 B
C++
37 lines
533 B
C++
#include <bits/stdc++.h>
|
|
#define endl '\n'
|
|
using namespace std;
|
|
|
|
int n, cnt = 0;
|
|
int arr[100100];
|
|
|
|
void insertion(int n){
|
|
for(int i = 2; i <= n; i++){ // i前面的都是有序的
|
|
int curr = arr[i]; // 当前乱序的第一个
|
|
int j = i - 1;
|
|
while(j >= 1 && arr[j] > curr){
|
|
cnt++;
|
|
arr[j+1] = arr[j];
|
|
j--;
|
|
}
|
|
j++;
|
|
|
|
arr[j] = curr;
|
|
}
|
|
}
|
|
|
|
int main() {
|
|
cin >> n;
|
|
for(int i = 1; i <= n; i++) {
|
|
cin >> arr[i];
|
|
}
|
|
|
|
insertion(n);
|
|
|
|
for(int i = 1; i <= n; i++) {
|
|
cout << arr[i] << " ";
|
|
}
|
|
cout << endl << cnt;
|
|
return 0;
|
|
}
|