P1766 液体滴落(贪心)

#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <cstring>
#include <set>
#include <cmath>
#include <map>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
const int MN = 65005;
const int MAXN = 100005;
const int INF = 0x3f3f3f3f;
#define reg register
#define IOS ios::sync_with_stdio(false)

int n, x;
double k[MAXN], b[MAXN];
int xx1[MAXN], xy1[MAXN];
int xx2[MAXN], xy2[MAXN];
int vis[MAXN];

int main() {
	scanf("%d %d", &n, &x);
	double y=1e9;
	for (int i = 1; i <= n; i++) {
		scanf("%d %d %d %d",xx1 + i, xy1 + i, xx2 + i, xy2 + i);
		if (xx1[i] > xx2[i]) {
			swap(xx1[i], xx2[i]);
			swap(xy1[i], xy2[i]);
		}
		k[i] = 1.0 * (xy1[i] - xy2[i]) / (xx1[i] - xx2[i]);
		b[i] = xy1[i] - k[i] * xx1[i];
	}
	while (1) {
		//printf("%d\n", x);
		int pos = 0;
		double yy;
		double maxh = -1e10;
		for (int i = 1; i <= n; i++) {
			if (vis[i] == 0) {
				if (x > xx1[i] && x < xx2[i]) {
					yy = k[i] * x + b[i];
					if(yy<=y){
						if(maxh<yy){
							maxh=yy;
							pos=i;
						}
					}
				}
			}
		}
		vis[pos] = 1;
		if (pos == 0) {
			break;
		} else {
			if (k[pos] > 0) {
				x = xx1[pos];
				y= xy1[pos];
			} else {
				x = xx2[pos];
				y=xy2[pos];
			}
		}
	}
	printf("%d", x);
	return 0;
}