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