10474 - Where is the Marble?

#include <stdio.h>
#include <algorithm>
int marbles[10000],queries[10000];
int main()
{
	int N,Q,count=0,isFound=0;
	while(scanf("%d",&N) && scanf("%d",&Q))
	{
		if(N==0 && Q==0) break;
		count++;
		for(int i=0;i<N;i++)
		{
			scanf("%d",&marbles[i]);
		}
		for(int i=0;i<Q;i++)
		{
			scanf("%d",&queries[i]);
		}
		std::sort(marbles,marbles+N);
		printf("CASE# %d:\n",count);
		for(int i=0;i<Q;i++)
		{
			for(int j=0;j<N;j++)
			{
				if(queries[i]==marbles[j])
				{
					printf("%d found at %d\n",queries[i],j+1);
					isFound=1;
					break;
				}
			}
			if(!isFound)
				printf("%d not found\n",queries[i]);
			isFound=0;
		}
	}
	return 0;
}

http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=1415