Submission #166302

#	Time	Username	Problem	Language	Result	Execution time	Memory
166302		itiam	Olivander (COCI18_olivander)	C++11	50 / 50	3 ms	380 KiB

olivander

#include <iostream>
#include <algorithm>

using namespace std;

int L[103],L2[103];

int cmp(int x,int y)
    {
    return x > y;
    }

int main(){
    int N,x,y;
    string t="DA";
    cin >> N;
    for (int i=0; i<N; i++){
        cin >> x;
        L[i]=x;
    }
    for (int i=0; i<N; i++){
        cin >> y;
        L2[i]=y;
    }
    sort(L,L+N,cmp);
    sort(L2,L2+N,cmp);
    for (int i=0; i<N; i++){
        if (L[i]>L2[i]){
            t="NE";
            break;
        }
    }
    cout << t;
    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