uva10487 - Closest Sums

凑就行！

#include<cstdlib>
#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<set>
#include<map>
#include<list>
#include<queue>
#include<vector>
#define LL long long
#define inf 0x7fffffff
#define eps 1e-7
#define M 105
#define N 13000
using namespace std;
int m,n,t;

int main()
{
#ifndef ONLINE_JUDGE
    freopen("ex.in","r",stdin);
#endif
    int ncase=0;
    while(scanf("%d",&n)==1&&n)
    {
        printf("Case %d:\n",++ncase);
        set<int>s;
        set<int>::iterator it;
        for (int i=0; i<n; ++i )
        {
            int x;
            scanf("%d",&x);
            s.insert(x);
        }
        scanf("%d",&m);
        for (int i=0; i<m; ++i )
        {
            int sum,a,b;
            scanf("%d",&sum);

            a=*s.begin()+*(++s.begin());
            t=abs(a-sum);
            for(it=s.begin(); it!=s.end(); it++)
            {
                
                if(*it>sum/2)break;
                set<int>::iterator jt=s.lower_bound(sum-*it);
                
                if(jt==s.begin())break;
                jt--;

                int d=(*it+*jt);
                if(it!=jt&&abs(d-sum)<t)
                {
                    a=d;
                    t=abs(d-sum);
                }

                jt++;
                if(jt==it)jt++;
                if(jt==s.end())continue;
                d=(*it+*jt);
                if(abs(d-sum)<t)
                {
                    a=d;
                    t=abs(d-sum);
                }

            }
            printf("Closest sum to %d is %d.\n",sum,a);
        }
    }

    return 0;
}