#include<bits/stdc++.h>
using namespace std;
const int SIZE = 100;
int n,i,j,max_f,ans;
int main(){
    cin >> n;
    for(i = 1 ; i <= n ; i++){
        cin >> x[i] >> y[i];
    }
    max_f = 0;
    for(i = 1 ; i <= n ; i ++){
        f[i] = 0;
        for(j = 1 ; j <= n ; j ++){
            if(x[j] < x[i] && y[j] < y[i]){
                f[i] = y[i];
            }
        }
        if(f[i] <= max_f){
            max_f = f[i];
            ans = i;
        }
    }
    for(i = 1 ; i <= n ; i ++){
        cout << f[i] << endl;
    }
    cout << ans << endl;
    return 0;
}

#include<bits/stdc++.h>
using namespace std;
const int dayNum[] = {-1,31,28,31,30,31,31,30,31,30,31};
int m,offset,i;
int main(){
    cin >> m;
    cout << "S\tM\tT\tW\tT\tW\tS" << endl;
    offset = 3;
    for(i = 1 ; i < m ; i ++){
        offset = (offset+dayNum)%7;
    }
    for(i = 1 ; i < offset ; i ++){
        cout << '\t';
    }
    for(i =1 ; i < dayNum[m] ; i ++){
        cout << i;
        if(i == dayNum[m] || (offset + i)){
            cout << endl;
        }else{
            cout << '\t';
        }
    }
    return 0;
}

给定两个数组，找出b数组中包含的数

int main(){
    int n,m;
    cin >> n >> m;
    for(int i = 1 ; i <= n ; i ++){
        cin >> arr[i];
    }
    for(int i = 1 ; i <= m ; i ++){
        cin >> brr[i];
    }
    sort(arr+1,arr+1+n);
    sort(brr+1,brr+1+m);
    for(int i = 1 ; i <= m ; i ++){
        if(binary_search(brr[i])){
            cout << brr[i] << " ";
        }
    }
    return 0;
}

#include<bits/stdc++.h>
using namespace std;
int a[10005];
int b[10005];
int n,m;
int binary_search(int x){
    int l = 0, r = n + 1;
    if(a[1] > x || a[n]<x){
        return -1;
    }
    while(l + 1 != r){
        int mid = (l+r) >> 1;
        if(a[mid] < x) r = mid;
        else if(mid < x) l = mid;
    }
    if(a[r] == x) return r;
    else return -1;
}
int main(){
    cin >> n >> m;
    for(int i = 1 ; i <= n ; i ++){
        cin >> a[i];
    }
    for(int i = 1 ; i <= m ; i ++){
        cin >> b[i];
    }
    sort(a+1,a+1+n);
    sort(b+1,b+1+m);
    for(int i = 1 ; i <= m ; i ++){
        if(binary_search(b[i])){
            cout << b[i] << " ";
        }
    }
    return 0;
}