Submission #483647

# Submission time Handle Problem Language Result Execution time Memory
483647 2021-10-31T12:45:09 Z Mostafa_Aboalkasim Olivander (COCI18_olivander) C++17
50 / 50
1 ms 288 KB
#include <iostream>
#include<algorithm>

using namespace std;

int main()
{
int n ;
cin >> n ;
int arr[n] , arr2[n];
for (int i = 0 ; i< n ; ++i)
{
    cin >> arr[i];
}
    sort(arr, arr +n);
for (int i = 0 ; i< n ; ++i)
{
    cin >> arr2[i];
}
    sort(arr2, arr2 +n);
for (int i = 0 ; i< n ; ++i)
{
if (arr[i] > arr2[i])
{
 cout << "NE";
    return 0;
}
}
    cout << "DA";
    return 0;
}

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 288 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct