hdu 5233 Gunner II

来源：互联网发布：淘宝盗图扣分规则编辑：程序博客网时间：2024/05/22 01:44

原题链接：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;}

0 0