UVA 11917 (Do Your Own Homework!)

/***
	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,cs=1,num,n,D;
	map<string,int>my_map;
	string s,str;
	sc("%d",&test);
	while(test--){
	sc("%d",&n);
	getchar();
	for(int i=1 ; i<=n ; i++){
	cin>>s>>num;
	my_map[s] = num;
	}
	sc("%d",&D);
	cin>>str;
	pf("Case %d: ",cs++);
	n = my_map[str];
	if(n==0 || (n>D)){
	if(n>(D+5)|| n==0){
	pf("Do your own homework!\n");
	}else if(n<=(D+5)){
	pf("Late\n");
	}
	}else if(n<=D){
	pf("Yesss\n");
	}
	my_map.clear();
	}
	return 0;
	}