Is it rated?

Here it is. The Ultimate Question of Competitive Programming, Codeforces, and Everything. And you are here to answer it.

Another Codeforces round has been conducted. No two participants have the same number of points. For each participant, from the top to the bottom of the standings, their rating before and after the round is known.

It's known that if at least one participant's rating has changed, then the round was rated for sure.

It's also known that if the round was rated and a participant with lower rating took a better place in the standings than a participant with higher rating, then at least one round participant's rating has changed.

In this problem, you should not make any other assumptions about the rating system.

Determine if the current round is rated, unrated, or it's impossible to determine whether it is rated of not.

The first line contains a single integer n (2 ≤ n ≤ 1000) —
the number of round participants.

Each of the next n lines contains two integers ai and bi (1 ≤ ai, bi ≤ 4126) —
the rating of the i-th participant before and after the round, respectively. The participants are listed in order from the top to
the bottom of the standings.

If the round is rated for sure, print "rated". If the round is unrated for sure, print "unrated".
If it's impossible to determine whether the round is rated or not, print "maybe".

In the first example, the ratings of the participants in the third and fifth places have changed, therefore, the round was rated.

In the second example, no one's rating has changed, but the participant in the second place has lower rating than the participant in the fourth place. Therefore, if the round was rated, someone's rating would've changed for sure.

In the third example, no one's rating has changed, and the participants took places in non-increasing order of their rating. Therefore, it's impossible to determine whether the round is rated or not.

——————————————————————————————————————题目的意思是给出两场比赛的前后分数，判断算不算分

思路：如果前后有比赛分数变了则必rated，否则根据前后大小判断是unrated或maybe

#include <iostream>

#include <cstdio>

#include <cstring>

#include <string>

#include <algorithm>

#include <cmath>

#include <map>

#include <cmath>

#include <set>

#include <stack>

#include <queue>

#include <vector>

#include <bitset>

#include <functional>

using namespace std;

#define LL long long

const int INF=0x3f3f3f3f;

int a[100005][2];

int main()

{

    int n;

   scanf("%d",&n);

   int flag=0;

   for(int i=0;i<n;i++)

   {

       scanf("%d%d",&a[i][0],&a[i][1]);

       if(a[i][0]!=a[i][1])

        flag=1;

   }

   if(!flag)

   for(int i=1;i<n;i++)

   {

       if(a[i][0]>a[i-1][0])

       {

           flag=2;

           break;

       }

   }

   if(flag==0)

    printf("maybe\n");

   else if(flag==1)

    printf("rated\n");

   else

    printf("unrated\n");

    return 0;

}