Submission #49825

#TimeUsernameProblemLanguageResultExecution timeMemory
49825A_H_GhaznaviOlivander (COCI18_olivander)C++14
50 / 50
3 ms772 KiB
// In the name of god
// A.H.Ghaznavi
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=110;
int n,y[maxn],x[maxn];
int main()
{
    cin>>n;
    for (int i=0;i<n;i++)
        cin>>x[i];
    sort (x, x+n);
    for (int i=0;i<n;i++)
        cin>>y[i];
    sort (y, y+n);
    for (int i=0;i<n;i++)
    {
        if (x[i]>y[i])
        {
            cout<<"NE";
            return 0;
        }
    }
    cout<<"DA";
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...