Problem:
Convex Hull

Find the convex hull of a given set of points P. In other words, find the smallest convex polygon containing all the points of P. Here, in a convex polygon, all interior angles are less than or equal to 180 degrees.

Please note that you should find all the points of P on both corner and boundary of the convex polygon.

Input

n
x1 y1
x2 y2
:
xn yn

The first integer n is the number of points in P. The coordinate of the i-th point pi is given by two integers xi and yi.

Output

In the first line, print the number of points on the corner/boundary of the convex polygon. In the following lines, print x y coordinates of the set of points.
The coordinates should be given in the order of counter-clockwise visit of them starting from the point in P with the minimum y-coordinate, or the leftmost such point in case of a tie.

Constraints

3 ≤ n ≤ 100000

-10000 ≤ xi, yi ≤ 10000

No point in the P will occur more than once.

Sample Input 1

7
2 1
0 0
1 2
2 2
4 2
1 3
3 3

Sample Output 1

5
0 0
2 1
4 2
3 3
1 3

Sample Input 2

4
0 0
2 2
0 2
0 1

Sample Output 2

4
0 0
2 2
0 2
0 1

Solution in C# (judge verdict: Accepted)

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;

namespace ConsoleApplication1
{
    class Program
    {
        static readonly double EPS = 1E-10;

        static void Main(string[] args)
        {
            int n = int.Parse(Console.ReadLine());

            List<Point> s = new List<Point>();

            for (int i = 0; i < n; i++)
            {
                double[] input = Array.ConvertAll(Console.ReadLine().Split(' '), double.Parse);
                s.Add(new Point(input[0], input[1]));
            }

            List<Point> ans = AndrewScan(s);
            int m = ans.Count;
            double minX = int.MaxValue, minY = int.MaxValue;
            int minIndex = 0;

            for (int i = 0; i < m; i++)
            {
                if (minY > ans[i].y || (minY == ans[i].y && minX > ans[i].x))
                {
                    minY = ans[i].y;
                    minX = ans[i].x;
                    minIndex = i;
                }
            }

            StringBuilder sb = new StringBuilder();
            sb.AppendLine(m.ToString());
            for(int i = 0; i < m; i++)
            {
                sb.AppendLine(ans[(i + minIndex) % m].ToString());
            }
            Console.Write(sb);
        }

        static List<Point> AndrewScan(List<Point> s)
        {
            int n = s.Count;

            if (n < 3) return s;

            s.Sort();

            List<Point> u = new List<Point>();
            u.Add(s[0]);
            u.Add(s[1]);

            List<Point> l = new List<Point>();
            l.Add(s[n - 1]);
            l.Add(s[n - 2]);

            for (int i = 2; i < n; i++)
            {
                for (int j = u.Count; j >= 2 && (u[j - 1] - u[j - 2]).Cross(s[i] - u[j - 2]) > EPS; j--)
                {
                    u.RemoveAt(u.Count - 1);
                }
                u.Add(s[i]);
            }

            for (int i = s.Count - 3; i >= 0; i--)
            {
                for (int j = l.Count; j >= 2 && (l[j - 1] - l[j - 2]).Cross(s[i] - l[j - 2]) > EPS; j--)
                {
                    l.RemoveAt(l.Count - 1);
                }
                l.Add(s[i]);
            }

            l.Reverse();
            for (int i = u.Count - 2; i >= 1; i--) l.Add(u[i]);

            return l;
        }
    }
    
    class Point : IComparable<Point>
    {
        static readonly double EPS = 1E-10;

        internal double x, y;

        public Point() { }

        public Point(double x, double y)
        {
            this.x = x;
            this.y = y;
        }

        public double Abs { get { return Math.Sqrt(Norm); } }
        public double Norm { get { return x * x + y * y; } }

        public double Dot(Point p) { return x * p.x + y * p.y; }
        public double Cross(Point p) { return x * p.y - y * p.x; }

        public static Point operator +(Point a, Point b) { return new Point(a.x + b.x, a.y + b.y); }
        public static Point operator -(Point a, Point b) { return new Point(a.x - b.x, a.y - b.y); }
        public static Point operator *(Point p, double d) { return new Point(p.x * d, p.y * d); }
        public static Point operator /(Point p, double d) { return new Point(p.x / d, p.y / d); }
        public static bool operator <(Point a, Point b) { return Math.Abs(a.x - b.x) > EPS ? a.x < b.x : a.y < b.y; }
        public static bool operator >(Point a, Point b) { return Math.Abs(a.x - b.x) > EPS ? a.x > b.x : a.y > b.y; }
        public static bool operator ==(Point a, Point b) { return Math.Abs(a.x - b.x) < EPS && Math.Abs(a.y - b.y) < EPS; }
        public static bool operator !=(Point a, Point b) { return Math.Abs(a.x - b.x) >= EPS || Math.Abs(a.y - b.y) >= EPS; }

        public int CompareTo(Point other)
        {
            return x != other.x ? (int)(x - other.x) : (int)(y - other.y);
        }

        public override bool Equals(object obj)
        {
            Point other = obj as Point;
            return Math.Abs(x - other.x) < EPS && Math.Abs(y - other.y) < EPS;
        }

        public override int GetHashCode()
        {
            return x.GetHashCode() ^ y.GetHashCode();
        }

        public override string ToString()
        {
            return string.Format("{0} {1}", x, y);
        }
    }

    class Segment
    {
        internal Point p1, p2;

        public Segment(Point p1, Point p2)
        {
            this.p1 = p1;
            this.p2 = p2;
        }
    }

    class Circle
    {
        internal Point p;
        internal double r;

        public Circle(Point p, double r)
        {
            this.p = p;
            this.r = r;
        }
    }
}