Map with custom key.cc

#include <string.h>
#include <cstdio>
#include <cstdlib>
#include <cmath>

#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <bitset>
#include <list>
#include <stack>
#include <queue>
#include <algorithm>
#include <numeric>
#include <sstream>


using namespace std;

#define FOR( i, L, U ) for(int i=(int)L ; i<=(int)U ; i++ )
#define FORD( i, U, L ) for(int i=(int)U ; i>=(int)L ; i-- )
#define SQR(x) ((x)*(x))

#define INF INT_MAX


#define READ(filename)  freopen(filename, "r", stdin);
#define WRITE(filename)  freopen(filename, "w", stdout);

typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<double> vd;
typedef vector<char> vc;
typedef vector<string> vs;
typedef vector<vector<int> > vvi;
typedef vector<vector<int> > vvc;
typedef map<int, int> mii;
typedef map<string, int> msi;
typedef map<int, string> mis;
typedef map<string, string> mss;
typedef map<string, char> msc;

#define WHITE 0
#define GRAY 1
#define BLACK 2

struct Point{
    int x;
    int y;
    Point(){y = x = 0;}
    Point(int y, int x){
        this->y = y;
        this->x = x;
    }

    bool operator < (Point a){
        if(this->x != a.x)return this->x < a.x;
        return this->y < a.y;
            }

};
 bool operator < (Point a, Point b){
        if(a.x != b.x )return a.x < b.x;
        return a.y < b.y;
    }
int main()
{
    //READ("input.txt");
    //WRITE("output.txt");
    map<Point,bool> h;

    Point  a = Point(1,2);
    h[a] = true;
    h[Point(2,3)] = true;
    h[Point(2,2)] = true;
    map<Point, bool> :: iterator  it;
    for(it = h.begin(); it != h.end(); it++) cout << (*it).first.x << " " << (*it).first.y << endl;
    if(h[Point(2,5)])cout << "found" << endl;
    else cout << "not found" << endl;
    for(it = h.begin(); it != h.end(); it++) cout << (*it).first.x << " " << (*it).first.y << endl;
	return 0;
}