제출 #683726

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
683726		raysh07	Olivander (COCI18_olivander)	C++17	50 / 50	1 ms	324 KiB

olivander

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define INF (int)1e18

mt19937_64 RNG(chrono::steady_clock::now().time_since_epoch().count());

void Solve() 
{
    int n;
    cin>>n;
    
    int x[n];
    int y[n];
    for (int i=0; i<n; i++) cin>>x[i];
    for (int i=0; i<n; i++) cin>>y[i];
    
    sort(x, x+n);
    sort(y, y+n);
    for (int i=0; i<n; i++){
        if (x[i] > y[i]){
            cout<<"NE\n";
            return;
        }
    }
    cout<<"DA\n";
}

int32_t main() 
{
    auto begin = std::chrono::high_resolution_clock::now();
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int t = 1;
 //   cin >> t;
    for(int i = 1; i <= t; i++) 
    {
        //cout << "Case #" << i << ": ";
        Solve();
    }
    auto end = std::chrono::high_resolution_clock::now();
    auto elapsed = std::chrono::duration_cast<std::chrono::nanoseconds>(end - begin);
    cerr << "Time measured: " << elapsed.count() * 1e-9 << " seconds.\n"; 
    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