【算法通关指南：数据结构和算法篇 】顺序表相关算法题 ：1.询问学号，2.寄包柜，3.合并两个有序数组

#include <iostream>
using namespace std;
const int N = 2e6 + 10;
int a[N];
int main()
{
	int n, m;
	cin >> n >> m;

	for (int i = 1; i <= n; i++)
		cin >> a[i];

	while (m--)
	{
		int x;
		cin >> x;

		cout << a[x] << endl;
	}
	return 0;
}

#include <iostream>
#include <vector>
using namespace std;
const int N = 2e6 + 10;
vector<int> a(N);
int main()
{
	int n, m;
	cin >> n >> m;

	for (int i = 1; i <= n; i++)
		cin >> a[i];

	while (m--)
	{
		int x;
		cin >> x;

		cout << a[x] << endl;
	}
	return 0;
}

#include <iostream>
#include <vector>
using namespace std;
const int N = 1e5 + 10;
vector<int> a[N];   //创建n个柜子
int main()
{
	int n, q;
	cin >> n >> q;

	while (q--)
	{
		int i, j, k, op;
		cin >> op >> i >> j;

		if (op == 1)
		{
			cin >> k;
			if (a[i].size() <= j) //vector创建从下标0开始
				a[i].resize(j + 1);
			a[i][j] = k;

		}
		else if (op == 2)
			cout << a[i][j] << endl;
	}
	return 0;
}

class Solution {
public:
    void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) {
       vector<int> temp(m + n);
       int cur1 = 0,cur2 = 0,i = 0;
       while(cur1 < m && cur2 < n)
       {
        if(nums1[cur1] <= nums2[cur2])
            temp[i++] = nums1[cur1++];
        else
            temp[i++] = nums2[cur2++];
       } 
       while(cur1 < m)
       {
           temp[i++] = nums1[cur1++];
       }
       while(cur2 < n)
        temp[i++] = nums2[cur2++];
       for(int i = 0;i < m + n;i++)
        nums1[i] = temp[i];
    }
};