Submission #87604

# Submission time Handle Problem Language Result Execution time Memory
87604 2018-12-01T11:42:23 Z duva02 Olivander (COCI18_olivander) C++14
50 / 50
9 ms 568 KB
#include<bits/stdc++.h>

using namespace std;

int n, s[103], k[103];

int main()
{
  //ios::sync_with_stdio(0);
  //cin.tie(0);

  cin >> n;
  for(int i = 0; i < n; ++i)
    cin >> s[i];
  for(int i = 0; i < n; ++i)
    cin >> k[i];
  sort(s, s + n);
  sort(k, k + n);
  
  int ok = 1;
  for(int i = 0; i < n; ++i)
    if(s[i] > k[i])
      ok = 0;
    
  if (ok == 1)
    cout << "DA";
  else
    cout << "NE";
  

  return 0;
}

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 372 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 5 ms 392 KB Output is correct
2 Correct 3 ms 568 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 568 KB Output is correct
2 Correct 2 ms 568 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 568 KB Output is correct
2 Correct 2 ms 568 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 568 KB Output is correct
2 Correct 2 ms 568 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 568 KB Output is correct
2 Correct 2 ms 568 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 9 ms 568 KB Output is correct
2 Correct 2 ms 568 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 568 KB Output is correct
2 Correct 2 ms 568 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 568 KB Output is correct
2 Correct 3 ms 568 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 3 ms 568 KB Output is correct
2 Correct 2 ms 568 KB Output is correct