Submission #42693

#	Time	Username	Problem	Language	Result	Execution time	Memory
42693		iletavcioski	Olivander (COCI18_olivander)	C++14	50 / 50	2 ms	552 KiB

olivander

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long ll;
int main()
{
    int n;
    cin>>n;
    vector<int> v1,v2;
    for(int i=0;i<n;i++)
    {
        int a;
        cin>>a;
        v1.push_back(a);
        
    }
    for(int i=0;i<n;i++)
    {
        int a;
        cin>>a;
        v2.push_back(a);
        
    }
    sort(v1.begin(),v1.end());
    sort(v2.begin(),v2.end());
    for(int i=0;i<n;i++)
    {
        if(v2[i]<v1[i])
        {
            cout<<"NE"<<endl;
            return 0;
        }

    }
    cout<<"DA"<<endl;
    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