HDU 1257 最少拦截系统

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1257

代码：

#include <iostream>#include<cstdio>using namespace std;int main(){    int n;    int a[1005];    while(scanf("%d",&n)!=EOF)    {        for(int i=1;i<=n;i++)            scanf("%d",&a[i]);        int num=0;        int count=n;        while(count)        {            num++;            int max=35000;            for(int i=1;i<=n;i++)            {                if(a[i]>0 && a[i]<max)                {                    max=a[i];                    a[i]=-1;                    count--;                }            }        }        printf("%d\n",num);    }    return 0;}