程序代码：

#include<stdio.h>
#define M    100
int cal(int map[][M], int n)
{
    int x[M] = {}, lx[M], mx[M];
    int y[M] = {}, ly[M], my[M];
    int c = 0, lxn, lyn, i, j, k, t;
   
    for(c = i = 0; i < n; i++)
    {
        if(x[i]) continue;
        for(j = 0; j < n; j++) mx[j] = my[j] = 0;
        mx[i] = 1;
        lx[0] = i;
        lxn = 1;
        lyn = 0;
        for(k = j = 0; j < lxn; j++)
        {
            for(t = 0; t < n; t++)
            {
                if(!map[lx[j]][t] || my[t]) continue;
                if(y[t]){ my[t] = 1; ly[lyn++] = t;}
                else{ x[i] = 1; y[t] = 1; c++; break;}
            }
            if(t != n) break;
            for(; k < lyn; k++)
            for(t = 0; t < n; t++)
            if(x[t] && map[t][ly[k]] && !mx[t])
            {
                lx[lxn++] = t;
                mx[t] = 1;
            }
        }
    }
    return c;
}
int main()
{
    int map[M][M], x[M], y[M], s[M], e[M];
    int t, n, i, j, d;
    for(scanf("%d", &t); t--; printf("%d\n", cal(map, n)))
    {
        for(scanf("%d", &n), i = 0; i < n; s[i] *= s[i], e[i] *= e[i], i++)
            scanf("%d%d%d%d", &x[i], &y[i], &s[i], &e[i]);
        for(i = 0; i < n; i++)
        for(j = 0; j < n; j++)
            map[i][j] = (d = (d = x[i] - x[j]) * d + (d = y[i] - y[j]) * d) >= s[i] && d <= e[i];
    }
    return 0;
}

程序代码：

#include <iostream>
#include <cstdlib>
#define N 100000
using namespace std;

int cmp(const void *a,const void *b)
{
    return *(int *)b-*(int *)a;
}

int main()
{
    int n,k,m,i,ai[N];
    while(cin>>n>>k)
    {   
        for(m=0,i=0;i<n;++i)    {cin>>ai[i];m+=ai[i];}
        if(m>k)
        {
            qsort(ai,n,sizeof(int),cmp);
            for(m=0,i=0;i<n;++i)
            {
                m+=ai[i];
                if(m >= k)    break;
            }
            cout<<i+1<<endl;
        }
        else    cout<<n<<endl;
    }
    return 0;
}