Submission #113216

#TimeUsernameProblemLanguageResultExecution timeMemory
113216tutisOlivander (COCI18_olivander)C++17
50 / 50
15 ms512 KiB
/*input 4 5 3 3 5 10 2 10 10 */ #pragma GCC optimize("Ofast,no-stack-protector") #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native") #include <bits/stdc++.h> using namespace std; typedef long long ll; int main() { ios_base::sync_with_stdio(false); int N; cin >> N; int X[N], Y[N]; for (int &i : X) cin >> i; for (int &i : Y) cin >> 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 0; } cout << "DA\n"; }
#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...