CSU暑期集训day01_B_Where is the Marble?

题目：

    Raju and Meena love to play with Marbles. They have got a lot of marbles with numbers written on them. At the beginning, Raju would place the marbles one after another in ascending order of the numbers written on them. Then Meena would ask Raju to find the first marble with a certain number. She would count 1...2...3. Raju gets one point for correct answer, and Meena gets the point if Raju fails. After some fixed number of trials the game ends and the player with maximum points wins. Today it’s your chance to play as Raju. Being the smart kid, you’d be taking the favor of a computer. But don’t underestimate Meena, she had written a program to keep track how much time you’re taking to give all the answers. So now you have to write a program, which will help you in your role as Raju.

Input

    There can be multiple test cases. Total no of test cases is less than 65. Each test case consists begins with 2 integers: N the number of marbles and Q the number of queries Mina would make. The next N lines would contain the numbers written on the N marbles. These marble numbers will not come in any particular order. Following Q lines will have Q queries. Be assured, none of the input numbers are greater than 10000 and none of them are negative. Input is terminated by a test case where N = 0 and Q = 0.

Output

    For each test case output the serial number of the case. For each of the queries, print one line of output. The format of this line will depend upon whether or not the query number is written upon any of the marbles. The two different formats are described below:

• ‘x found at y’, if the first marble with number x was found at position y. Positions are numbered 1, 2, . . . , N.

• ‘x not found’, if the marble with number x is not present. Look at the output for sample input for details.

Sample Input

4 1

2 3 5 1 5

5 2

1 3 3 3 1 2 3

0 0

Sample Output

CASE# 1:

5 found at 4

CASE# 2:

2 not found

3 found at 3

 

题目大意总结：

    输入一串无序的数字，然后进行若干次询问，要求回答出询问的数字在之前输入的数字串中是否出现过，若出现过则回答出该数字在数字串经从小到大有序排列后首次出现的位置。

解题思路：

    将输入的数字串按从小到大排序，用lower_bound()函数即可返回指定数字在数字串中首次出现的位置。

    其中函数lower_bound()的功能是在first和last中的前闭后开区间进行二分查找，返回大于或等于val的第一个元素位置。如果所有元素都小于val，则返回last的位置。即返回元素值大于等于查找值的第一个位置。

    具体用法：int location=lower_bound(arr,arr+n,key)   location接收返回值，arr是存有数字序列的数组，key是要查找的值。

代码：

#include <iostream>
#include <set>
#include <algorithm>

using namespace std;

int main(){  
    int n,m;
    int ce=1;
    while(cin>>n>>m){
        if(n==0&&m==0)break;
        int a[10002]={10001};       
        cout<<"CASE# "<<ce<<':'<<endl;
        ce++;
        for(int i=0;i<n;i++){
            cin>>a[i]; 
        }
        sort(a,a+n);
        for(int i=0;i<m;i++){
            int k;
            cin>>k;           
            int w=lower_bound(a,a+n,k)-a;
            if(a[w]==k)cout<<k<<" found at "<<w+1<<endl;
            else cout<<k<<" not found"<<endl;
        }     
    }
    return 0;
}