Submission #483647

#	Time	Username	Problem	Language	Result	Execution time	Memory
483647		Mostafa_Aboalkasim	Olivander (COCI18_olivander)	C++17	50 / 50	1 ms	288 KiB

olivander

#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;
}

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 5 / 5
• Subtask 4: 5 / 5
• Subtask 5: 5 / 5
• Subtask 6: 5 / 5
• Subtask 7: 5 / 5
• Subtask 8: 5 / 5
• Subtask 9: 5 / 5
• Subtask 10: 5 / 5