题解 | 星尘轨迹分析

#include <iostream>
#include <set>
#include <map>
using namespace std;

int main() {
    int a, b;
    map<int, set<int>> myMap;
    int lastTime = 0;
    long min = 100000;
    int max = -1;
    while (cin >> a >> b) { // 注意 while 处理多个 case
        int diff = b - lastTime;
        if(diff <= min){
            min = diff;
        }
        if (diff >= max) {
            max = diff;
        }
        myMap[diff].insert(a);
    
        lastTime = b;
        
    }
    cout << *myMap[min].begin() << " " <<*myMap[max].begin() << endl;
}
// 64 位输出请用 printf("%lld")