iframe-proxy | Sunbelt Computer Software

67 lines (55 loc) · 1.04 KB

#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
using namespace std;
typedef pair<int, int> pii; 
const int MAXN = 100001;
const int INF = 999999999;
pii d[MAXN];
bool mycmp(const pii & a, const pii & b){
    if(a.second==b.second){
        return a.first<b.first;
    return a.second<b.second;
void work(){
    int ans = 0;
    int cur = -INF;
    for(int i=0; i<N; i++){
        if(cur+1<=d[i].first){
            cur = d[i].second;
            ans+=1;
    cout<<ans<<endl;
int main(){
    scanf("%d",&N);
    for(int i=0; i<N; i++){
        scanf("%d %d",&d[i].first, &d[i].second);
    sort(d,d+N,mycmp);
    for(int i=0; i<N; i++){
        cout<<d[i].first<<" "<<d[i].second<<endl;
    work();
    return 0;

Sunbelt Computer Software

PL/B Language Development and Support

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Uh oh!

Sunbelt Computer Software

PL/B Language Development and Support

Uh oh!

FilesExpand file tree

1203.cpp

Latest commit

History

1203.cpp

File metadata and controls