算法竞赛入门经典第五章例题5-1 Where is the Marble? UVA - 10474

最新推荐文章于 2021-01-31 16:41:27 发布

Bendaai

最新推荐文章于 2021-01-31 16:41:27 发布

阅读量729

点赞数

本文链接：https://blog.csdn.net/Bendaai/article/details/78991913

版权

https://vjudge.net/problem/UVA-10474

#include<iostream>
#include<algorithm>
#pragma warning(disable:4996)
using namespace std;
const int maxn = 10005;
int A[maxn];
int main() {
#ifdef _DEBUG
    //freopen("in", "rb", stdin);
    //freopen("out", "wb", stdout);
#endif // _DEBUG
    int N, q,cnt=0,qq;
    while (cin >> N >> q &&(N||q)) {
        for (int i = 0; i < N; ++i)
            cin >> A[i];
        sort(A, A + N);
        printf("CASE# %d:\n", ++cnt);
        while (q--) {
            cin >> qq;
            int p = lower_bound(A, A + N, qq)-A;
            if (A[p] == qq) printf("%d found at %d\n", qq, p + 1);
            else printf("%d not found\n", qq);
        }

    }
}