Submission #312034

---

Source Code Expand

#include <iostream>
#include <set>
#include <algorithm>
#include <iterator>
using namespace std;

int main(int, char**){
    int n,a_i,b_i,b_max = 0;
    pair<int,int> ap[100001];
    pair<int,int> bp[100001];

    cin >> n;

    for(long long int i = 0;i < n;++i){
        cin >> a_i >> b_i;
        ap[i].first = a_i;
        ap[i].second = i;
        bp[i].first = b_i;
        bp[i].second = i;
        if(b_max < b_i) b_max = b_i;
    }
    sort(ap, ap+n);
    sort(bp, bp+n);


    int dp_count[1000001];
    //int dp_minnum[1000001] = {0};
    long long int ans = 0, t=1000001;

    vector<int> lis;
    for(long long int i = 0;i < b_max;++i){
        cout << b_max-i << endl;
    }
    return 0;
}

Submission Info

Judge Result