fork download 
  1. #include <iostream>
  2. #include <string>
  3. #include <algorithm>
  4. #include <vector>
  5. #include <string>
  6. #include <cstring>
  7. #include <map>
  8. #include <queue>
  9. #include <cstdio>
  10. #include <set>
  11. #include <cmath>
  12. #include <limits.h>
  13. #include <iomanip>
  14. #include <stack>
  15. #include <cstdlib>
  16. #define INF 1000;
  17. #define REP(i,n)  for(int i=0;i<n;++i)
  18. #define FOR( i,a,n)  for(int i=a;i<=n;++i)
  19. using namespace std;
  20. #define mac(a) #a
  21. #define scl(a)scanf("%lld",&a)
  22. #define sc(a)scanf("%d",&a)
  23. #include<sstream>
  24. #include <iostream>
  25. #include <vector>
  26. #include <algorithm>
  27. #define scc(x)  scanf("%c",&x)
  28. using namespace std;
  29. vector < pair< int ,int > >v;
  30. int greedy(vector<pair < int,int > >v,int n){
  31.     int cnt=1;
  32.     int t=v[0].first;
  33. for(int i=0;i<n;++i){
  34.  
  35.         if(v[i].second>=t){
  36.             cnt++;
  37.             t=v[i].first;
  38.         }
  39. }
  40. return cnt;
  41. }
  42. int main(){
  43.     int t,ans=0;
  44.     sc(t);
  45.     while(t--){
  46.         int n;
  47.         sc(n);
  48.         int k=n;
  49.         while(k--){
  50.                 int a,b;
  51.         sc(a);sc(b);
  52.         pair<int,int> p=make_pair(b,a);
  53.         v.push_back(p);
  54.         }
  55.        sort(v.begin(),v.end());
  56.        ans=greedy(v,n);
  57.        cout<<ans<<"\n";
  58.        v.erase(v.begin(),v.end());
  59.     }
  60.  
  61. return 0;}
Time limit exceeded #stdin #stdout 5s 68992KB
comments (?)
stdin 
Standard input is empty
stdout 
Standard output is empty
https://ideone.com/MIjqtd
language:
C++ (gcc 8.3)
created:
10 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!