CF1108A. Two distinct points (水题)

题意: 给出两个区间(可能相交, 重合, 覆盖), 要求找出两个不同的点在两个区间, 特判

水题, 直接判读输出即可

#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <string>
#include <stdlib.h>
#include <vector>
#include <queue>
#include <cmath>
#include <stack>
#include <map>
using namespace std;
#define ms(x, n) memset(x,n,sizeof(x));
typedef  long long LL;
const LL maxn = 1e6+10;

int main()
{
    int q, l1, r1, l2, r2;
    cin >> q;
    while(q--){
        cin >> l1 >> r1 >> l2 >> r2;
        if(l1!=l2) cout << l1 << " "<< l2 << endl;
        else cout << r1 << " "<< l2 << endl;
    }

	return 0;
}