Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- using p=pair<int,int>;
- bool compare (p a,p b){
- return a.first<b.first;
- }
- int main(){
- int n;
- scanf("%d",&n);
- vector <p> v;
- for(int i=1;i<=n;i++){
- int s,t;
- scanf("%d %d",&s,&t);
- v.push_back({s,i});
- v.push_back({t,i});
- }
- sort(v.begin(),v.end(),compare);
- stack <int> st;
- bool check=true;
- for(int i=0;i<v.size();i++){
- int x=v[i].second;
- if(st.size()==0 || st.top()!=x) st.push(x);
- else if(st.top()==x) st.pop();
- else check=false;
- }
- if(check==true && st.size()==0) printf("Yes");
- else printf("No");
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement