codeforces 593B 排序水题

题目：
The teacher gave Anton a large geometry homework, but he didn’t do it (as usual) as he participated in a regular round on Codeforces. In the task he was given a set of n lines defined by the equations y = ki·x + bi. It was necessary to determine whether there is at least one point of intersection of two of these lines, that lays strictly inside the strip between x1 < x2. In other words, is it true that there are 1 ≤ i < j ≤ n and x’, y’, such that:

y’ = ki * x’ + bi, that is, point (x’, y’) belongs to the line number i;
y’ = kj * x’ + bj, that is, point (x’, y’) belongs to the line number j;
x1 < x’ < x2, that is, point (x’, y’) lies inside the strip bounded by x1 < x2.
You can’t leave Anton in trouble, can you? Write a program that solves the given task.

Input
The first line of the input contains an integer n (2 ≤ n ≤ 100 000) — the number of lines in the task given to Anton. The second line contains integers x1 and x2 ( - 1 000 000 ≤ x1 < x2 ≤ 1 000 000) defining the strip inside which you need to find a point of intersection of at least two lines.

The following n lines contain integers ki, bi ( - 1 000 000 ≤ ki, bi ≤ 1 000 000) — the descriptions of the lines. It is guaranteed that all lines are pairwise distinct, that is, for any two i ≠ j it is true that either ki ≠ kj, or bi ≠ bj.

Output
Print “Yes” (without quotes), if there is at least one intersection of two distinct lines, located strictly inside the strip. Otherwise print “No” (without quotes).

Examples
Input

4
1 2
1 2
1 0
0 1
0 2

Output

NO

Input

2
1 3
1 0
-1 3

Output

YES

Input

2
1 3
1 0
0 2

Output

YES

Input

2
1 3
1 0
0 3

Output

NO

本题的思路很简单，不用多讲

需要注意的是数据范围一定要是long long
一定要排序，不然会T到爆
对左端点y值排序同时对右端点y值排序
如左端点由大到小，若左端相等，则右端由大到小
最后固定左端比较右端

AC代码如下：

#include<iostream>
#include<algorithm>
using namespace std;

class linenode
{
public:
	long long int y1, y2;
};

bool cmp(linenode a, linenode b)
{
	if (a.y1 == b.y1)
		return a.y2 < b.y2;
	else 
	return a.y1 < b.y1;
}

linenode a[100010];

int main()
{
	long int T;
	cin >> T;
	long int x;
	x = T;
	long long int x1, x2;
	cin >> x1 >> x2;
	while (T--)
	{
		long long int k, b;
		cin >> k >> b;
		a[T].y1 = x1*k + b;
		a[T].y2 = x2*k + b;
	}

	sort(a, a + x, cmp);

	for (int i = 1; i < x;i++)
	{ 

		if (a[i].y2 < a[i-1].y2)
		{
			cout << "YES\n";
			return 0;
		}
	}
	cout << "NO\n";
	return 0;
}