Program mencari titik terdekat dengan Struct/Class C++

Berhubung aq orangnya kurang pinter ngomong, langsung ajha deh... Ni........ Bismillahirohmanirrohim...


#include <cstdlib>
#include <iostream>
#include <math.h>
#define SIZE 100
using namespace std;

class Point
{
  public :
  int x, y;
};

void closestPair( Point * p, int n, Point &p1, Point &p2 )
{
  float d, dmin;
  int i, j;

  dmin = 9999;
  for ( i = 1; i < n; i++ )
  {
    for ( j = i + 1; j <=n; j++ )  {
      d = sqrt( pow(( p[i].x - p[j].x ),2) + pow(( p[i].y - p[j].y ),2) );
      if ( d < dmin )
      {
        dmin = d;
        p1 = p[i];
        p2 = p[j];
      }
    }

  }
}

int main(int argc, char *argv[])
{
    int n;
  Point p[SIZE];
  Point p1,p2;
  cout<<"Masukkan banyak titik : "; cin>>n;
  for(int i=1;i<=n;i++){
   cout<<"x"<<i<<" "; cin>>p[i].x;
   cout<<"y"<<i<<" "; cin>>p[i].y;
  }
  closestPair(p,n, p1, p2);
  cout<<"titik terdekat "<<p1.x<<","<<p1.y<<" dan ";
  cout<<p2.x<<","<<p2.y;

    system("PAUSE");
    return EXIT_SUCCESS;
}