Submission #251932

#TimeUsernameProblemLanguageResultExecution timeMemory
251932Vladikus004Olivander (COCI18_olivander)C++14
50 / 50
1 ms384 KiB
#include <bits/stdc++.h> #define inf 2e9 #define all(v) v.begin(), v.end() using namespace std; typedef long long ll; typedef long double ld; typedef pair <int, int> pii; const int N = 101; int n, a[N], b[N]; int main() { ios_base::sync_with_stdio(false); cin.tie(0); #ifdef LOCAL freopen("input.txt", "r", stdin); #endif // LOCAL 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...