CodeForces 589F Gourmet and Banquet（贪心+二分）

F. Gourmet and Banquet

time limit per test

2 seconds

memory limit per test

512 megabytes

input

standard input

output

standard output

A gourmet came into the banquet hall, where the cooks suggested n dishes for guests. The gourmet knows the schedule: when each of the dishes will be served.

For i-th of the dishes he knows two integer moments in time ai and bi (in seconds from the beginning of the banquet) — when the cooks will bring the i-th dish into the hall and when they will carry it out (ai < bi). For example, if ai = 10 and bi = 11, then the i-th dish is available for eating during one second.

The dishes come in very large quantities, so it is guaranteed that as long as the dish is available for eating (i. e. while it is in the hall) it cannot run out.

The gourmet wants to try each of the n dishes and not to offend any of the cooks. Because of that the gourmet wants to eat each of the dishes for the same amount of time. During eating the gourmet can instantly switch between the dishes. Switching between dishes is allowed for him only at integer moments in time. The gourmet can eat no more than one dish simultaneously. It is allowed to return to a dish after eating any other dishes.

The gourmet wants to eat as long as possible on the banquet without violating any conditions described above. Can you help him and find out the maximum total time he can eat the dishes on the banquet?

Input

The first line of input contains an integer n (1 ≤ n ≤ 100) — the number of dishes on the banquet.

The following n lines contain information about availability of the dishes. The i-th line contains two integers ai and bi(0 ≤ ai < bi ≤ 10000) — the moments in time when the i-th dish becomes available for eating and when the i-th dish is taken away from the hall.

Output

Output should contain the only integer — the maximum total time the gourmet can eat the dishes on the banquet.

The gourmet can instantly switch between the dishes but only at integer moments in time. It is allowed to return to a dish after eating any other dishes. Also in every moment in time he can eat no more than one dish.

Examples

input

3
2 4
1 5
6 9

output

6

input

3
1 2
1 2
1 2

output

0

Note

In the first example the gourmet eats the second dish for one second (from the moment in time 1 to the moment in time 2), then he eats the first dish for two seconds (from 2 to 4), then he returns to the second dish for one second (from 4 to 5). After that he eats the third dish for two seconds (from 6 to 8).

In the second example the gourmet cannot eat each dish for at least one second because there are three dishes but they are available for only one second (from 1 to 2).

题目大意：给出n个区间，对每个区间选出若干子区间，要求所有子区间不相交，并且n个区间的子区间和相等，求子区间和*n的最大值。

思路：二分枚举子区间和即可。

#include<cstdio>
#include<cstring>
#include<vector>
#include<cmath>
#include<iostream>
#include<algorithm>
#include<queue>
#include<set>
#include<map>
#include<cctype>
using namespace std;

const int maxn = 100 + 10;
const int INF = 1e9+10;
int n;
struct node
{
    int a,b;
    bool operator < (const node& rhs) const
    {
        return b < rhs.b || b == rhs.b && a < rhs.a;
    }
}dish[maxn];

int vis[10010];

bool judge(int x)
{
    memset(vis, 0, sizeof vis);
    for (int i = 0; i < n; i++) {
        if (dish[i].b - dish[i].a < x) return false;
        int cnt = 0;
        for (int j = dish[i].a; cnt < x && j < dish[i].b; j++) {
            if (vis[j]) continue;
            vis[j] = 1;
            cnt++;
        }
        if (cnt < x) return false;
    }
    return true;
}

int main()
{
   scanf("%d",&n);
   int ans = 0;
   for (int i = 0; i < n; i++) {
       scanf("%d%d",&dish[i].a, &dish[i].b);
       ans = max(ans, dish[i].b - dish[i].a);
   }
   sort(dish, dish+n);
   int l = 0, r = 10000;
   while(r - l > 1) {
      int mid = (l+r) >> 1;
      if (judge(mid)) l = mid;
      else r = mid;
   }
   if (judge(l)) printf("%d\n",l*n);
   else printf("0\n");
}