137C History

Problem Link

<Source Code>

#include<bits/stdc++.h>
#define ll long long
#define pr pair<ll,ll>
using namespace std;
int main()
{

long long n,i;
cin>>n;
pr b[n];
for(int i=0;i<n;i++)
{
cin>>b[i].first>>b[i].second;}
sort(b,b+n);
ll mx=b[0].second;
ll res=0;
for(i=1;i<n;i++){
if(mx>=b[i].second)
res++;
else mx=b[i].second;



}
co
Advertisements

About waprogramming

I am in CSE,from CUET
This entry was posted in Codeforces, Uncategorized and tagged , , . Bookmark the permalink.

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s