CodeForces 160B - Unlucky Ticket

最新推荐文章于 2019-11-08 12:30:39 发布

原创最新推荐文章于 2019-11-08 12:30:39 发布 · 886 阅读

0 ·

CC 4.0 BY-SA版权

CodeForces 同时被 2 个专栏收录

14 篇文章

订阅专栏

杂题

11 篇文章

订阅专栏

本文介绍了一种用于判断车票是否符合不幸准则的方法。该准则通过比较车票号码前半部分与后半部分的数字大小来确定车票是否不幸。文章详细解释了不幸准则的具体内容，并提供了一个示例程序来演示如何实现这一判断过程。

Each of you probably has your personal experience of riding public transportation and buying tickets. After a person buys a ticket (which traditionally has an even number of digits), he usually checks whether the ticket is lucky. Let us remind you that a ticket is lucky if the sum of digits in its first half matches the sum of digits in its second half.

But of course, not every ticket can be lucky. Far from it! Moreover, sometimes one look at a ticket can be enough to say right away that the ticket is not lucky. So, let's consider the following unluckiness criterion that can definitely determine an unlucky ticket. We'll say that a ticket is definitely unlucky if each digit from the first half corresponds to some digit from the second half so that each digit from the first half is strictly less than the corresponding digit from the second one or each digit from the first half is strictly more than the corresponding digit from the second one. Each digit should be used exactly once in the comparisons. In other words, there is suchbijective correspondence between the digits of the first and the second half of the ticket, that either each digit of the first half turns outstrictly less than the corresponding digit of the second half or each digit of the first half turns out strictly more than the corresponding digit from the second half.

For example, ticket 2421 meets the following unluckiness criterion and will not be considered lucky (the sought correspondence is 2 > 1and 4 > 2), ticket 0135 also meets the criterion (the sought correspondence is 0 < 3 and 1 < 5), and ticket 3754 does not meet the criterion.

You have a ticket in your hands, it contains 2n digits. Your task is to check whether it meets the unluckiness criterion.

Input

The first line contains an integer n (1 ≤ n ≤ 100). The second line contains a string that consists of 2n digits and defines your ticket.

Output

In the first line print "YES" if the ticket meets the unluckiness criterion. Otherwise, print "NO" (without the quotes).

Sample test(s)

input
2
2421

output
YES

input
2
0135

output
YES

input
2
3754

output
NO

================================

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>

using namespace std;

int main()
{
    int n,flag1=1,flag2=1,a[111],b[111];char str[222];
    cin>>n;
    cin>>str;
    for(int i=0;i<n;i++) a[i]=str[i]-'0';
    for(int i=n;i<2*n;i++) b[i-n]=str[i]-'0';
    sort(a,a+n);
    sort(b,b+n);
    
    for(int i=0;i<n;i++)
    {
        if(a[i]<=b[i])
        {
            flag1=0;
            break;
        }
    }
    for(int i=0;i<n;i++)
    {
        if(a[i]>=b[i])
        {
            flag2=0;
            break;
        }
    }
    //cout<<flag1<<" "<<flag2<<endl;
    if(!flag1&&!flag2) printf("NO\n");
    else printf("YES\n");
    return 0;
}