UVA 12015 - Google is Feeling Lucky

/***
	Md. Nazmul Hasan
	Shahjalal University of Science & Technology,Sylhet.
	hasan08sust@gmail.com
	***/
	#include<iostream>
	#include<cstdio>
	#include<stack>
	#include<queue>
	#include<map>
	#include<vector>
	#include<algorithm>
	#include<cstring>
	#include<sstream>
	#include<cmath>
	#include <iomanip>
	using namespace std ;
	typedef long long ll ;
	typedef int in ;
	typedef unsigned long long ull ;
	const double pi = 2*acos(0) ;
	#define maxi 40000
	#define pf printf
	#define sc scanf
	#define pb push_back
	#define MEM(x,y) (memset((x),(y),sizeof(x)))
	#define MIN(x,y) ((x) < (y) ? (x) : (y))
	#define MAX(x,y) ((x) > (y) ? (x) : (y))
	#define load(array,size) for(int i=0 ; i<size ; i++) cin>>array[i] ;
	#define new_line pf("\n")
	#define clear_data(array) memset(array,0,sizeof(array))
	#define highest_int 2147483647
	int main()
	{
	int test,n,cs=1,p,mx;
	string str,s;
	map<int,string>my_map;
	vector<int>data;
	sc("%d",&test);
	getchar();
	while(test--)
	{
	int i=0;
	mx =0;
	while(true)
	{
	getline(cin,str);
	stringstream ss(str);
	ss>>s>>n;
	if(mx <n)
	mx = n;
	my_map[i] = s;
	data.pb(n);
	i++;
	if(i==10)
	break;
	}
	pf("Case #%d:\n",cs++);
	for(i=0 ; i<data.size() ; i++)
	{
	p = data[i];
	if(p == mx)
	{
	cout<<my_map[i]<<endl;
	}
	}
	data.clear();
	my_map.clear();
	}
	return 0;
	}