Submission #684181

#TimeUsernameProblemLanguageResultExecution timeMemory
684181sudheerays123Olivander (COCI18_olivander)C++17
50 / 50
1 ms324 KiB
#include<bits/stdc++.h> using namespace std; #define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); #define ll long long int const ll N = 100+5 , INF = 1e18 , MOD = 1e9+7; void solve(){ ll n; cin >> n; vector<ll> a(n+5); multiset<ll> s; for(ll i = 1; i <= n; i++) cin >> a[i]; for(ll i = 1; i <= n; i++){ ll x; cin >> x; s.insert(x); } for(ll i = 1; i <= n; i++){ auto it = s.lower_bound(a[i]); if(it == s.end()){ cout << "NE"; return; } s.erase(it); } cout << "DA"; } int main(){ fast; ll tc = 1; // cin >> tc; while(tc--) solve(); return 0; }
#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...