Submission #130042

# Submission time Handle Problem Language Result Execution time Memory
130042 2019-07-13T19:41:12 Z 44442 Olivander (COCI18_olivander) C++11
50 / 50
2 ms 380 KB
#include <bits/stdc++.h>
using namespace std;
long long n,x[102],y[102],a;
int main (){
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
     cin>>n;
     for(long long i=0;i<n;i++){
     	 cin>>x[i];
	 }
	 for(long long i=0;i<n;i++){
	 	 cin>>y[i];
	 }
	 sort(x,x+n);
	 sort(y,y+n);
	 for(long long i=0;i<n;i++){
	 	if(y[i]<x[i])
	 	     a=1;
	 }
	 if(a==1) 
	     cout<<"NE";
	 else
	     cout<<"DA";
return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 380 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 380 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 380 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct