Dandan's lunch

https://ac.nowcoder.com/acm/contest/338/D

题解：计算一下面积，排序

参考文章：https://blog.csdn.net/weixin_43272781/article/details/85800560

/*
*@Author:   STZG
*@Language: C++
*/
#include <bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<cstdlib>
#include<cstring>
#include<cstdio>
#include<string>
#include<vector>
#include<bitset>
#include<queue>
#include<deque>
#include<stack>
#include<cmath>
#include<list>
#include<map>
#include<set>
//#define DEBUG
#define RI register int
using namespace std;
typedef long long ll;
//typedef __int128 lll;
const int N=100000+10;
const int MOD=1e9+7;
const double PI = acos(-1.0);
const double EXP = 1E-8;
const int INF = 0x3f3f3f3f;
int t,n,m,k,q,ans;
int a[N];
ll b[N];
char str;
ll x[3];
ll y[3];
ll S(){
    return labs(x[0]*y[1]+x[1]*y[2]+x[2]*y[0]-x[0]*y[2]-x[1]*y[0]-x[2]*y[1]);

}
int main()
{
#ifdef DEBUG
	freopen("input.in", "r", stdin);
	//freopen("output.out", "w", stdout);
#endif
    scanf("%d",&n);

    for(int i=1;i<=n;i++){
        scanf("%d%lld%lld%lld%lld%lld%lld",&q,&x[0],&y[0],&x[1],&y[1],&x[2],&y[2]);
        a[i]=q;
        b[i]=S();

    }
    k=a[1];
    sort(a+1,a+n+1);
    sort(b+1,b+n+1);
    ans=lower_bound(a+1,a+n+1,k)-a;
    cout << b[ans] << endl;
    //cout << "Hello world!" << endl;
    return 0;
}