Codeforces Round #149 (Div. 2)——B

B. Big Segment

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

A coordinate line has n segments, the i-th segment starts at the position l_i and ends at the position r_i. We will denote such a segment as [l_i, r_i].

You have suggested that one of the defined segments covers all others. In other words, there is such segment in the given set, which contains all other ones. Now you want to test your assumption. Find in the given set the segment which covers all other segments, and print its number. If such a segment doesn't exist, print -1.

Formally we will assume that segment [a, b] covers segment [c, d], if they meet this condition a ≤ c ≤ d ≤ b.

Input

The first line contains integer n (1 ≤ n ≤ 10⁵) — the number of segments. Next n lines contain the descriptions of the segments. The i-th line contains two space-separated integers l_i, r_i (1 ≤ l_i ≤ r_i ≤ 10⁹) — the borders of the i-th segment.

It is guaranteed that no two segments coincide.

Output

Print a single integer — the number of the segment that covers all other segments in the set. If there's no solution, print -1.

The segments are numbered starting from 1 in the order in which they appear in the input.

Sample test(s)

input

3
1 1
2 2
3 3

output

-1

input

6
1 5
2 3
1 10
7 10
7 7
10 10

output

3

这是自己写的：

#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
#define maxn 100005
struct anpai{
  int start;
  int end;
}s[maxn];
int main()
{
    int n,idx=1;
    scanf("%d",&n);
    scanf("%d%d",&s[1].start,&s[1].end);
    int max=s[1].end,min=s[1].start;
    for(int i=2;i<=n;i++)
        {
          scanf("%d%d",&s[i].start,&s[i].end);
          //找到开始时间小，结束时间大的那个，此处注意，是同时满足，不一定是开始时间和结束时间的最小值
          if(min>=s[i].start&&max<=s[i].end)
          {
              max=s[i].end;
              min=s[i].start;
              idx=i;
          }
        }
    for(int i=1;i<=n;i++)
    {
      if(max<s[i].end||min>s[i].start)//判断找的那个是否满足开始时间最小且结束时间最大
      {
          printf("-1\n");
          return 0;
      }
    }
    printf("%d\n",idx);
    return 0;
}

这是神牛的代码

#include<iostream>
using namespace std;

int main(){
int n,a,b,c,d,ans=-1;
cin>>n;
for(int i=0;i<n;i++){
cin>>a>>b;
if(i==0){c=a;d=b;}
if(a<c){c=a; ans=-1;}
if(d<b){d=b; ans=-1;}
if(a==c&&b==d)ans=i+1;}
cout<<ans<<endl;}