Submission #62575

# Submission time Handle Problem Language Result Execution time Memory
62575 2018-07-29T07:07:56 Z win11905 Olivander (COCI18_olivander) C++11
50 / 50
4 ms 744 KB
#include <bits/stdc++.h>
using namespace std;

int n;
vector<int> a, b;

int main() {
    cin >> n;
    a.resize(n), b.resize(n);
    for_each(a.begin(), a.end(), [](int &x) { cin >> x; });
    for_each(b.begin(), b.end(), [](int &x) { cin >> x; });
    sort(a.begin(), a.end()), sort(b.begin(), b.end());
    bool st = true;
    for(int i = 0; i < n; ++i) st &= (a[i] <= b[i]);
    puts(st ? "DA" : "NE");
}
# Verdict Execution time Memory Grader output
1 Correct 3 ms 252 KB Output is correct
2 Correct 3 ms 360 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 3 ms 404 KB Output is correct
2 Correct 2 ms 512 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 3 ms 564 KB Output is correct
2 Correct 3 ms 628 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 3 ms 680 KB Output is correct
2 Correct 2 ms 728 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 3 ms 736 KB Output is correct
2 Correct 2 ms 736 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 3 ms 736 KB Output is correct
2 Correct 3 ms 744 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 3 ms 744 KB Output is correct
2 Correct 2 ms 744 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 3 ms 744 KB Output is correct
2 Correct 3 ms 744 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 3 ms 744 KB Output is correct
2 Correct 2 ms 744 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 4 ms 744 KB Output is correct
2 Correct 2 ms 744 KB Output is correct