codeforces Rockethon 2014 A

题目连接：http://codeforces.com/contest/395/problem/A2

set：

#include <iostream>
#include <set>
using namespace std;
#include <cstdio>
#include <cstring>
#define INF 0x3fffffff
int n,q;
int main()
{
    int i,x,y,ans;
    while(~scanf("%d%d",&n,&q))
    {
        ans=0;
        multiset<int> s;
        multiset<int>::iterator it,it1;
        ans=0;
        for(i=1;i<=n;++i)
        {
            scanf("%d",&x);
            if(i==1)
            s.insert(x);
            else
            {
                it=s.find(q-x);
                if(it!=s.end())
                {
                    s.erase(it);
                    ++ans;
                    //printf("+%d %d\n",*it,x);
                }
                else
                    s.insert(x);
            }
        }
        printf("%d\n",ans);
        s.clear();
    }
    return 0;
}