题目不难，先排序再查找，对C++语言做点小结——Vector的使用

1. #include <vector>
2. vector<int> v;
3. v.clear();
4. v.resize(int n); 将vector的大小重置为n
5. v[int i] 可通过索引i直接获取内容
6. sort(a_vector.begin(), a_vector.end()) 调用函数排序，需要algorithm包 

#include <iostream>
#include <algorithm> //包含sort(a_vector.begin(), a_vector.end())
#include <cstring>
#include <vector>

using namespace std;

vector<int> v;
int number[10001];

void the_case(int N, int Q)
{
    v.clear();
    memset(number, 0, sizeof(number));
    v.resize(N);
    for(int i=0; i<N; i++)
    {
        cin >> v[i]; 
    }
    sort(v.begin(), v.end());
    for(int i=0; i<N; i++)
    {
        if(number[v[i]]==0) number[v[i]]=i+1;
    }
    while(Q--)
    {
        int t;
        cin >> t;
        if(number[t]==0) cout << t << " not found\n";
        else cout << t << " found at " << number[t] << endl;
    }
}

int main()
{
    int c=1;
    int N, Q;
    while(true)
    {
        cin >> N >> Q;
        if(N==0 && Q==0) break;
        cout << "CASE# " << c << ":\n";
        the_case(N,Q);
        c++;
    }
    return 0;
}