UVA 10474－Where is the Marble?

UVA 10474－Where is the Marble?

#include <stdio.h>
#include <iostream>
using namespace std;
int main() {
int m, n;
int a[100000];
int b;
int all = 0;
while(scanf("%d%d", &m, &n) && m != 0 && n != 0) {
all++;
for(int i = 0; i < m; i++)
scanf("%d", &a[i]);
for(int i = 0; i < m - 1; i++)
for(int j = 0; j < m - i -1; j++)
if(a[j] >= a[j+1]) {
int t = a[j];
a[j] = a[j+1];
a[j+1] = t;
}
printf("CASE# %d:\n", all);
for(int i = 0; i < n; i++) {
scanf("%d", &b);
int x = 0;
for(int j = 0; j < m; j++) {
x++;
if(a[j] == b) {
printf("%d found at %d\n", b, x);
x = -1;
break;
}
}
if(x != -1)
printf("%d not found\n", b);

}
}

return 0;
}