UVa10474(排序和查找)

//思路:用vector<int>存储，在sort排序就可以了

AC代码：

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;


int main()
{
	int N,Q,kase=0;
	while(cin>>N>>Q&&N)
	{
		cout<<"CASE# "<<(++kase)<<":"<<endl;
		vector<int> ivec;
		while(N--)
		{
			int num;
			cin>>num;
			ivec.push_back(num);
		}
		sort(ivec.begin(),ivec.end());
		while(Q--)
		{
			int num;
			cin>>num;
			int ok=0;
			for(int i=0;i<ivec.size();++i)
				if(ivec[i]==num)
				{
					ok=1;
					cout<<num<<" found at "<<i+1<<endl;
					break;
				}
			if(!ok)
				cout<<num<<" not found"<<endl;
		}
	}
	return 0;
}