# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
483641 | Mostafa_Aboalkasim | Olivander (COCI18_olivander) | C++14 | 1 ms | 268 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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];
}
int q1 = sizeof(arr) / sizeof(arr[0]);
sort(arr, arr +q1);
for (int i = 0 ; i< n ; ++i)
{
cin >> arr2[i];
}
int q2 = sizeof(arr2) / sizeof(arr2[0]);
sort(arr, arr +q2);
int test = 1 ;
for (int i = 0 ; i< n ; ++i)
{
if (arr[i] > arr2[i])
{
test = 0 ;
break;
}
}
if (test == 1)
cout << "DA";
else
cout << "NE";
return 0;
}
Compilation message (stderr)
# | 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... |