이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
string can_place_wands_in_boxes(int N, vector<int>& wand_lengths, vector<int>& box_sizes) {
sort(wand_lengths.begin(), wand_lengths.end());
sort(box_sizes.begin(), box_sizes.end());
for (int i = 0; i < N; ++i) {
if (wand_lengths[i] > box_sizes[i]) {
return "NE";
}
}
return "DA";
}
int main() {
int N;
cin >> N;
vector<int> wand_lengths(N);
vector<int> box_sizes(N);
for (int i = 0; i < N; ++i) {
cin >> wand_lengths[i];
}
for (int i = 0; i < N; ++i) {
cin >> box_sizes[i];
}
string result = can_place_wands_in_boxes(N, wand_lengths, box_sizes);
cout << result << endl;
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |