#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

class Point
{
   public:
   double x;
   double y;
   bool operator < (const Point &p) const; 
   Point(){}
   Point(double a,double b) { x=a; y=b; }

   friend std::ostream & operator << (std::ostream & o, const Point &p) ;
};

std::ostream & operator << (std::ostream & o, const Point &p) 
{
    o<<p.x<<" "<<p.y;
}


bool Point::operator < (const Point &p) const
{
   if(x<p.x)
     { 
        return true;
     }
   else
     {
       if(!(p.x<x)) // dann sind beide gleich
          {
             if(y<p.y)
                {
                    return true;
                }
              else
                {
                    return false;
                }
	  }
         else
           {
	     return false;
           }
     }
}

void print(vector<Point> &v)
  {
      for(int i=0;i<v.size();i++)
         {
             cout<<v[i]<<"\n";
         }
      cout<<"\n";
  }

void swapme(Point &i, Point &j)
   {
       Point tmp;
       tmp=i;
       i=j;
       j=tmp;
   }

int bubblesort(vector<Point> &v)
{
   int n=v.size();
   for(int i=0;i<n;i++)
     {
        for(int j=0;j<n-i-1;j++)
          {
              //cout<<"Vergleich von "<<j<<" "<<j+1<<endl;
              if(v[j+1]<v[j])
                 {
                      swapme(v[j+1],v[j]);
                 }
          }
        //cout<<"\n";
     }
}


int main()
{
    vector<Point> w;
    w.push_back(Point(1,3)); // 
    w.push_back(Point(1,1)); //
    w.push_back(Point(2,1)); //
    w.push_back(Point(2,2)); //
    w.push_back(Point(3,1)); //
    w.push_back(Point(1,2)); //

    cout<<"Unsortiert."<<endl;
    print(w);
    bubblesort(w);
    //sort(w.begin(),w.end());  // das Quicksort aus <algorithm>

    cout<<"Sortiert."<<endl;
    print(w);
}