返回题解分享
讨论 / 题解分享/ 帖子详情

vector排序 - 题解

#include <bits/stdc++.h>
using namespace std;

int main()
{
    vector<int> a[1003];
    int n;
    cin >> n;
    int x, y;
    int c;
    for (int i = 0; i < n; i++)
    {
        cin >> c;
        for (int j = 0; j < c; j++)
        {
            cin >> x;
            a[i].push_back(x);
        }
        sort(a[i].begin(), a[i].end());
    }

    sort(a, a + n);

    for (int i = 0; i < n; i++)
    {
        for (auto &ele : a[i])
        {
            cout << ele << ' ';
        }
        cout << endl;
    }

    return 0;
}
0 回复 0 转发 0 喜欢 3 阅读
回复 (0)
默认 最新
暂无回复,快来抢沙发!