PAT 1050 螺旋矩阵 (25 分)

#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
using namespace std;
bool cmp(int a,int b){
    return b<a;
}

int main() {
    int N,temp,m,n,t=0;
    cin>>N;
    vector<int> a(N);
    for(int i=0;i<N;i++){
        cin>>temp;
        a.push_back(temp);
    }
    sort(a.begin(),a.end(),cmp);   //从大到小排序
    for(int i=sqrt(N);i<=N;i++){    //找出m n
        if(N/i<=i&&N%i==0){
            m=i;
            n=N/i;
            break;
        }
    }
    vector<vector<int>> b(m,vector<int>(n));
    int level = m / 2 + m % 2;   
    for (int i = 0; i < level; i++) {                        //顺时针填充，i控制外层循环
        for (int j = i; j <= n - 1 - i && t <= N - 1; j++)   //四个内层循环，还要控制螺旋矩阵中所有的元素已经都填充完毕，就不能再重复填充
                b[i][j] = a[t++];
        for (int j = i + 1; j <= m - 2 - i && t <= N - 1; j++)
                b[j][n - 1 - i] = a[t++];
        for (int j = n - i - 1; j >= i && t <= N - 1; j--)
                b[m - 1 - i][j] = a[t++];
        for (int j = m - 2 - i; j >= i + 1 && t <= N - 1; j--)
                b[j][i] = a[t++];
    }
    for (int i = 0; i < m; i++) {                              //输出矩阵
        for (int j = 0 ; j < n; j++) {
            printf("%d", b[i][j]);
            if (j != n - 1) printf(" ");
        }
        printf("\n");
    }
    system("pause");
    return 0;
}