POJ 3069 Saruman‘s Army

#include <iostream>
#include<algorithm>
using namespace std;
int n,r;
#define MAX_N 10000
int x[MAX_N];
int goal[MAX_N];
int main()
{
    scanf("%d",&r);
    scanf("%d",&n);
    int index=0;
    while(r!=-1 && n!=-1)
    {
        int res=0;
        for(int i=0;i<n;i++)
        {
            scanf("%d",&x[i]);
        }
        sort(x,x+n);
        int i=0;
        while(i<n)
        {
            int s=x[i++];
            while(i<n && x[i]<=r+s) i++;
            int g=x[i-1];
            while(i<n && x[i]<=r+g) i++;
            res++;
        }
        goal[index++]=res;
        scanf("%d",&r);
        scanf("%d",&n);
    }
    for(int i=0;i<index;i++)
        printf("%d\n",goal[i]);
    return 0;
}