超级水题,给出n个数字,再给出m个。输出这m个在这n个数字中牌第几个。就是给n个数字排序,然后找m个数字,每个数字的位置。。。
AC代码:
#include<algorithm>
#include<stdio.h>
using namespace std;
int main () {
int m,n;
int mnum[10000];
int nnum[10000];
bool find = false;
int t = 1;
while (scanf("%d%d", &m, &n)) {
if (m == 0 && n==0)
break ;
printf ( "CASE# %d:\n",t++ );
for ( int i = 0 ;i < m ;i++) {
scanf ("%d",&mnum[i]);
}
for ( int j = 0 ; j < n ;j++) {
scanf ("%d" ,&nnum[j]);
}
sort(mnum , mnum + m) ;
for (int i = 0 ; i < n ;i++) {
find = false;
for ( int j = 0 ; j < m ;j++) {
if (nnum[i] == mnum[j] ) {
find = true ;
printf ("%d found at %d\n",nnum[i],j+1);
break ;
}
}
if ( find == false)
printf( "%d not found\n",nnum[i]);
}
}
return 0;
}