Submission #722302

#TimeUsernameProblemLanguageResultExecution timeMemory
722302vjudge1Olivander (COCI18_olivander)C++17
50 / 50
14 ms23808 KiB
#include <bits/stdc++.h> #define B begin() #define E end() #define F first #define S second #define pb push_back #define pf push_front #define eb emplace_back #define ll long long #define ui unsigned int #define ull unsigned long long #define sts stable_sort using namespace std; const int MAXN = 1e6 + 4; const int MOD = 1e9 + 7; vector<int> add[MAXN]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n; cin >> n; vector<ll> v(n), b(n); for(int i = 0; i < n; i++){ cin >> v[i]; } for(int i = 0; i < n; i++){ cin >> b[i]; } sts(v.B, v.E); sts(b.B, b.E); bool a = 1; for(int i = 0; i < n; i++){ if(v[i] <= b[i])continue; else{a = 0; break;} } if(a)cout << "DA\n"; else{cout << "NE\n";} return 0; }
#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...