Submission #580060

#TimeUsernameProblemLanguageResultExecution timeMemory
5800607as__7Olivander (COCI18_olivander)C++17
50 / 50
1 ms212 KiB
#include <bits/stdc++.h> using namespace std; #define endl "\n" #define int long long int32_t main(){ ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0); int t = 1; //cin >> t; while(t--){ int n; cin >> n; int a[n],b[n]; for(int i = 0;i<n;i++){ cin >> a[i]; } for(int i = 0;i<n;i++){ cin >> b[i]; } sort(a,a+n);sort(b,b+n); map<int,int>mp; int tot = 0; for(int i = 0;i<n;i++){ for(int j = 0;j<n;j++){ if(a[i] <= b[j] && mp[j] == 0){ tot++; mp[j] = 1; break; } } } if(tot < n){ cout << "NE"; } else cout << "DA"; } }
#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...