杭电ACM2020：绝对值排序

#include <iostream>using namespace std;int main(){    int n,t;    int a[100];    while (cin >> n && n != 0){        for (int i = 0; i < n; i++)            cin >> a[i];        //感觉就是“冒泡”排序吧，第一轮第一个位置，第二轮第二个位置，绝对值比大小换位        for (int i = 0; i < n; i++){            for (int j = i + 1; j < n; j++){                if (abs(a[i]) < abs(a[j])){                    t = a[i];                    a[i] = a[j];                    a[j] = t;                }            }        }        for (int i = 0; i < n - 1; i++)            cout << a[i] << " ";        cout << a[n - 1] << endl;    }    return 0;}