Submission #580058

#TimeUsernameProblemLanguageResultExecution timeMemory
580058Muaath_5Olivander (COCI18_olivander)C++17
50 / 50
1 ms212 KiB
#include <bits/stdc++.h> #define ll long long #define endl '\n' #define tc int _; std::cin >> _; while (_--) // Test cases using namespace std; const int N = 101; const int Mod = 1e9 + 3; int n; int a[N], b[N]; int main() { // Szia Nandi ur!! ios::sync_with_stdio(0), cin.tie(0), cout.tie(0); cin >> n; for (int i = 0; i < n; i++) cin >> a[i]; for (int i = 0; i < n; i++) cin >> b[i]; sort(a, a + n); sort(b, b + n); for (int i = 0; i < n; i++) { if (a[i] > b[i]) { cout << "NE"; return 0; } } cout << "DA"; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...