fork download
copy 
  1. #include <iostream>
  2. #include <vector>
  3. using namespace std;
  4.  
  5. int main()
  6. {
  7.  
  8.     int num;
  9.     int n1,n2;
  10.     cin >> num;
  11.     int nums[num*2];
  12.     int i = 0;
  13.     int max = 0;
  14.     int min = 2147483647;
  15.     int length = num * 2;
  16.     int count = 0;
  17.     bool lol = false;
  18.     while(num--)
  19.     {
  20.         cin >> n1 >> n2;
  21.         nums[i]=n1;
  22.         i++;
  23.         nums[i]=n2;
  24.         i++;
  25.         if(n2 > max)
  26.             max = n2;
  27.         if(n1 > max)
  28.             max = n1;
  29.         if(n1 < min)
  30.             min = n1;
  31.         if(n2 < min)
  32.             min = n2;
  33.     }
  34.     for(int j = min; j < max ; j++)
  35.     {
  36.         for(int k = 0; k < length; k+=2)
  37.         {
  38.             if(j >= nums[k] && j <= nums[k + 1])
  39.                 lol = true;
  40.         }
  41.         if(!lol)
  42.             count++;
  43.         lol = false;
  44.     }
  45.     cout << max - count;
  46.  
  47. }
Success #stdin #stdout 0.01s 5320KB
comments (?)
stdin
copy 
4
1 3
2 6
8 10
9 12
stdout
copy 
11
https://ideone.com/YLJGCP
language:
C++ (gcc 8.3)
created:
2 days 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!