hdu 5233 Gunner II

最新推荐文章于 2017-03-06 23:02:35 发布

GadyPu

最新推荐文章于 2017-03-06 23:02:35 发布

阅读量371

点赞数

分类专栏：杂题文章标签：文章标题

本文链接：https://blog.csdn.net/u012077152/article/details/45951493

版权

杂题专栏收录该内容

54 篇文章 0 订阅

订阅专栏

原题链接：http://acm.hdu.edu.cn/showproblem.php?pid=5233
简单题，stl水之。。。

#include<algorithm>
#include<iostream>
#include<cstdlib>
#include<cstdio>
#include<set>
using std::multiset;
struct Node {
    int val, pos;
    Node(int _val = 0, int _pos = 0) :val(_val), pos(_pos){}
};
struct cmp{
    bool operator()(const Node &a, const Node &b) const {
        if (a.val == b.val) return a.pos < b.pos;
        return a.val < b.val;
    }
};
multiset<Node,cmp> rec;
int main() {
#ifdef LOCAL
    freopen("in.txt", "r", stdin);
    freopen("out.txt", "w+", stdout);
#endif
    int n, m, v;
    while (~scanf("%d %d", &n, &m)) {
        for (int i = 1; i <= n; i++) {
            scanf("%d", &v);
            Node t(v, i);
            rec.insert(t);
        }
        while (m--) {
            scanf("%d", &v);
            multiset<Node, cmp>::iterator ite = rec.lower_bound(v);
            if (ite == rec.end() || v < ite->val) puts("-1");
            else printf("%d\n", ite->pos), rec.erase(ite);
        }
        rec.clear();
    }
    return 0;
}