bool cmp(vector&a,vector&b){
if(a[0]!=b[0]) return a[0]
else return a[1]>b[1];
}
for (int i = 0; i < 10; i++){
sort(viA[i].begin(), viA[i].end());//默认为从小到大排序
}
#include<stdio.h>#include<algorithm>#include<vector>#include<stdlib.h>#include<iostream>using namespace std; int main(){ vector<vector<int>> viA(10); for (int i = 0; i < 10;i++) for (int j = 0; j < 10; j++){ viA[i].push_back(rand()%100); } for (int i = 0; i < 10; i++){ for (int j = 0; j < 10; j++){ cout << viA[i][j] << "\t"; } cout << endl; } cout << "按行排序后的输出" << endl; for (int i = 0; i < 10; i++){ sort(viA[i].begin(), viA[i].end());//默认为从小到大排序 } for (int i = 0; i < 10; i++){ for (int j = 0; j < 10; j++){ cout << viA[i][j] << "\t"; } cout << endl; } while (1); return 0;
