贪心（排序）

https://codeforces.com/gym/102215/problem/F

#include <iostream>
#include <cstring>
#include <algorithm>
#define PII pair<int,int>
using namespace std;
#define ll long long
const int N =3e5 + 10;
int n;

struct Node {
    ll a, b;
    int id;
}f[N];

bool cmp(Node a, Node b){
    return a.a > b.a; 
}

int main()
{
   scanf("%d",&n);
    for (int i = 1; i <= n; i++) scanf("%d %d", &f[i].a, &f[i].b), f[i].id = i;
    
    sort(f+1,f+1+n, cmp);
    
    ll loss = 0;
    int x = 0, y = 0;
    int i = 1, j = 2;
    while(i <= n || j <= n)
    {
        if(i==j) j++;
        ll c1 = f[i].b - f[j].a, c2 = f[j].b - f[i].a;
        if(c1 <= 0 and c2 <= 0) {
            if(loss <= f[i].a + f[j].a) {
                loss = f[i].a + f[j].a;
                x = f[i].id;
                y = f[j].id;
            }
            break;
        }else if(c1 >0 && c2>0) j++;
        else if(c1 <= 0) { // i已经被kill，但是j没有被kill
            if(f[i].a>=loss) {
                loss = f[i].a;
                x = f[i].id;
                y = f[j].id;
            }
            j++; // 往下找一个j能被i kill的
        }
        else if(c2<=0) { // 同理
            if(loss<=f[j].a) {
                loss = f[j].a;
                x = f[i].id;
                y = f[j].id;
            }
            i++;
        } 
    }
    
    cout << loss << endl;
    if(loss) 
        cout << x << " " << y << endl;
    else cout << 1 << " " << 2 << endl;
    return 0;
}