練習1：
二維vector操作：

#include<iostream> #include <vector> using namespace std; int main() {vector<vector<int>> a;vector<int> b;b.push_back(1);b.push_back(2);vector<int> c;c.push_back(11);c.push_back(22);a.push_back(b);a.push_back(c);for (int i = 0; i <size(a); i++){for (int j = 0; j < size(a[i]); j++){cout << a[i][j] << endl;}}system("pause");return 0; }

運行結果：

求第k個數組中的最小值：

#include<iostream> #include <vector> #include <algorithm> using namespace std; int main() {vector<vector<int>> a;int count;cout << "請輸入數組個數:" << endl;cin >> count;for (int i = 0; i < count; i++){cout << "請輸入第" << i+1 << "個數組元素個數:" << endl;int num;cin >> num;cout << "請分別輸入元素：" << endl;vector<int> b;b.clear();for (int j = 0; j < num; j++){int element;cin >> element;b.push_back(element);}a.push_back(b);}for (int i = 0; i <size(a); i++){cout << "第" << i+1 << "個數組元素分別為:" << endl;for (int j = 0; j < size(a[i]); j++){cout << a[i][j] << " ";}cout << endl;}int k_temp,k = 0;cout << "請輸入你需要查找的那個k值:" ;cin >> k_temp;k = k_temp - 1;if (k > a.size()){cout << "您輸入的數超出數組個數范圍，error！！！" << endl;return -1;}else if (k > a[k].size()){cout << "您輸入的數超出數組元素范圍，error！！！" << endl;return -1;}else{sort(a[k].begin(), a[k].end());//下標遍歷cout << "下標遍歷" << endl;for (int l = 0; l < a[k].size(); l++){cout << a[k][l] << " ";}//迭代器遍歷cout << endl<<"迭代器遍歷" << endl;for (vector<int>::iterator iter = a[k].begin(); iter != a[k].end(); ++iter){cout << *iter << " ";}cout << endl;cout << "您要找的元素為：";cout << a[k][0] << endl;}cout << endl;system("pause");return 0; }

運行結果：

總結

以上是生活随笔為你收集整理的第k个数组中的最小值的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。