uva 10474 Where is the Marble?

排序而已。。。。不过时间有点长，以后再考虑考虑怎么写

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
vector<int> num;
int main(){
    int n,q,cishu=1;
    vector<int>::iterator result;
    while(cin>>n>>q){
        if(!n&&!q)
            break;
        int temp;
        for(int i=0;i<n;i++){
            cin>>temp;
            num.push_back(temp);
        }
        sort(num.begin(),num.end(),less<int>());
        cout<<"CASE# "<<cishu++<<":"<<endl;
        for(int i=0;i<q;i++){
            cin>>temp;
            result=find(num.begin(),num.end(),temp);
            if(result==num.end())
                cout<<temp<<" not found"<<endl;
            else
                cout<<temp<<" found at "<<result-num.begin()+1<<endl;
        }
        num.clear();
        
    }
}