Codeforces Round #773 (Div. 2)

A.Hard Way

排序找最高两个点判断一下

#include 
#define int long long
using namespace std;

struct node{
    int x, y;
    const bool operator> a[i].y;
    sort(a + 1, a + 4);
    if(a[2].y == a[3].y) cout  n;
    for(int i = 1; i > a[i], mp[a[i]]++;
    int cnt = mp.size();
    for(int k = 1; k