UVA 11987 Where is the Marble? [排序水题]

题目传送门

不知道什么时候做的排序水题，感觉还挺有趣的。

#include<cstdio>#include<cstring>#include<iostream>#include<algorithm>#include<cmath>using namespace std;int a[10005],m,n,cas,ans;inline long long read(){    static char ch;long long flag=1,res;    while((ch=getchar())<'0'||ch>'9')if(ch=='-')flag=-1;res=ch-48;    while((ch=getchar())>='0'&&ch<='9')res=res*10+ch-48;    return res*=flag;}int main(){    while(scanf("%d%d",&m,&n)!=EOF){        if(m==0&&n==0)break;        printf("CASE# %d:\n",++cas);        memset(a,0,sizeof(a));        for(register int i=0;i<m;i++)            ++a[read()];        for(register int t,i=0;i<n;i++){            t=read(),ans=0;            if(a[t] == 0)printf("%d not found\n",t);            else{                for(register int i=0;i<t;i++)ans+=a[i];                printf("%d found at %d\n",t,ans + 1);            }        }    }    return 0;}