codeforceA. Piles With Stones【水题】

最新推荐文章于 2021-07-18 11:29:37 发布

不会敲代码的小帅

最新推荐文章于 2021-07-18 11:29:37 发布

阅读量368

点赞数

CC 4.0 BY-SA版权

限于博主技术水平有限，若有错误请指教，若有不明白的也可以留言，博主考到必答复您，若要使用和分享还请您注明出处，谢谢。

本文链接：https://blog.youkuaiyun.com/SunPeishuai/article/details/81712802

探讨在Innopolis的石头花园中，两组参与者记录的石头数量变化是否可能由EJOI评审团成员的夜间活动引起。评审团成员可能取走石头或将石头从一堆移到另一堆，参与者试图验证笔记的一致性。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

A. Piles With Stones

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

There is a beautiful garden of stones in Innopolis.

Its most beautiful place is the nn piles with stones numbered from 11 to nn.

EJOI participants have visited this place twice.

When they first visited it, the number of stones in piles was x1,x2,…,xnx1,x2,…,xn, correspondingly. One of the participants wrote down this sequence in a notebook.

They visited it again the following day, and the number of stones in piles was equal to y1,y2,…,yny1,y2,…,yn. One of the participants also wrote it down in a notebook.

It is well known that every member of the EJOI jury during the night either sits in the room 108108 or comes to the place with stones. Each jury member who comes there either takes one stone for himself or moves one stone from one pile to another. We can assume that there is an unlimited number of jury members. No one except the jury goes to the place with stones at night.

Participants want to know whether their notes can be correct or they are sure to have made a mistake.

Input

The first line of the input file contains a single integer nn, the number of piles with stones in the garden (1≤n≤501≤n≤50).

The second line contains nn integers separated by spaces x1,x2,…,xnx1,x2,…,xn, the number of stones in piles recorded in the notebook when the participants came to the place with stones for the first time (0≤xi≤10000≤xi≤1000).

The third line contains nn integers separated by spaces y1,y2,…,yny1,y2,…,yn, the number of stones in piles recorded in the notebook when the participants came to the place with stones for the second time (0≤yi≤10000≤yi≤1000).

Output

If the records can be consistent output "Yes", otherwise output "No" (quotes for clarity).

Examples

input

Copy

5
1 2 3 4 5
2 1 4 3 5

output

Copy

Yes

input

Copy

5
1 1 1 1 1
1 0 1 0 1

output

Copy

Yes

input

Copy

3
2 3 9
1 7 9

output

Copy

No

水题直接上代码，不要多想这个题

代码：

#include<iostream>
#include<cstdio>
#include<string>
#include<cmath>
#include<algorithm>
using namespace std;
int a[108],b[108],a1,b1;
int main()
{
    int n;
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
    {
          cin>>a[i];
          a1+=a[i];
    }

    for(int i=1;i<=n;i++)
    {
            cin>>b[i];
            b1+=b[i];
    }
    if(b1-a1<=2&&b1<=a1) printf("Yes\n");
    else printf("No\n");
    return 0;

}