hdu5058

来源：互联网发布：ubuntu 查看重启日志编辑：程序博客网时间：2024/06/06 03:28

LINK:http://acm.hdu.edu.cn/showproblem.php?pid=5058

本题主要是考察队stl中set的应用，比较简单

#include<stdio.h>#include<climits>#include<algorithm>#include<stack>#include<iostream>#include<cmath>#include<set>#include<vector>#include<map>#include<queue>#include<string.h>using namespace std;int  main(void){  int n;  while(scanf("%d",&n)!=EOF)  { set<int>s1; set<int>s2; set<int>::iterator it1; set<int>::iterator it2; for(int i=0;i<n;i++) {              int x;              scanf("%d",&x);              s1.insert(x);         }          for(int i=0;i<n;i++) {              int x;              scanf("%d",&x);              s2.insert(x);         }         if(s1.size()!=s2.size())         {          printf("NO\n");           continue; } int flag=1;         for(it1=s1.begin(),it2=s2.begin();it1!=s1.end();it1++,it2++)         {            if(*it1!=*it2)            {           printf("NO\n");           flag=0;           break;        }         }         if(flag==0) continue;         printf("YES\n");      }   return 0;}

0 0