UVA 10474

//很水的题，我看时间3秒，数据10000以内，就直接冒泡排序，然后一个查找就OK了，发现uva的水体最大难度在与题目英文超长，每次读题都很痛苦，好吧，我只好用这个了
//http://www.nocow.cn    
#include <stdio.h>
#include <string.h>
int main()
{
    int n, m, a[10010], b[10010], i, j, cout = 1, flag, temp;
    while( scanf( "%d%d", &m, &n ) && m && n)
    {
        
        for( i = 1; i <= m; i++ )
            scanf( "%d", &a[i] );
        for( i = 1; i <= n; i++ )
            scanf( "%d", &b[i] );
        for( i = 1; i <= m; i++ )
            for( j = 1; j <= m; j++ )
                if( a[i] < a[j] )
                {
                    temp = a[i];
                    a[i] = a[j];
                    a[j] = temp;
                }
        printf( "CASE# %d:\n", cout++ );
        for( j = 1; j <= n; j++ )
        {
            flag = 0;
            for( i = 1; i <= m; i++ )
            {
                if( a[i] == b[j] )
                {
                    flag = 1;
                    printf( "%d found at %d\n", b[j], i );
                    break;
                }
            }
            if( !flag )
                printf( "%d not found\n", b[j] );
        }
    }
    return 0;
}

//此题还有大牛的代码，计数排序，以前从来木有听说过。。。好吧....orz
#include<stdio.h>
int main()
{
    int n,m,test=0;
    while (scanf("%d%d",&n,&m)==2)
    {
          if (n==0)break;
          printf("CASE# %d:\n",++test);
          int i,x,a[10001]={0},b[10001]={0};
          for (i=1;i<=n;i++) {scanf("%d",&x);a[x]++;}
          for (i=1;i<=10000;i++) b[i]=b[i-1]+a[i];
          for (i=1;i<=m;i++) 
          {
              scanf("%d",&x);
              if (a[x]==0) printf("%d not found\n",x);
              else printf("%d found at %d\n",x,b[x-1]+1);
          }
    }
    return 0;
}