Submission #49825

# Submission time Handle Problem Language Result Execution time Memory
49825 2018-06-03T11:19:20 Z A_H_Ghaznavi Olivander (COCI18_olivander) C++14
50 / 50
3 ms 772 KB
// 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 time Memory Grader output
1 Correct 3 ms 248 KB Output is correct
2 Correct 3 ms 488 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 3 ms 488 KB Output is correct
2 Correct 2 ms 496 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 680 KB Output is correct
2 Correct 3 ms 680 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 3 ms 680 KB Output is correct
2 Correct 2 ms 680 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 3 ms 680 KB Output is correct
2 Correct 2 ms 680 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 3 ms 680 KB Output is correct
2 Correct 2 ms 708 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 708 KB Output is correct
2 Correct 3 ms 708 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 708 KB Output is correct
2 Correct 2 ms 708 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 772 KB Output is correct
2 Correct 2 ms 772 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 772 KB Output is correct
2 Correct 3 ms 772 KB Output is correct