이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include<bits/stdc++.h>
#define endl "\n"
#define ll long long
#define map unordered_map
#define start cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(0);
using namespace std;
int main()
{
start
//freopen("codeblocksinput.txt", "r", stdin);
int t=1;
//cin>>t;
while(t--)
{
int n, x[100], y[100];
bool is=0;
cin>>n;
for(int i=0; i<n; i++)
cin>>x[i];
for(int i=0; i<n; i++)
cin>>y[i];
sort(x, x+n);
sort(y, y+n);
for(int i=0; i<n; i++)
{
if(y[i]<x[i])
{
is=1;
break;
}
}
cout<<(is ? "NE" : "DA")<<endl;
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |