Submission #83642

#TimeUsernameProblemLanguageResultExecution timeMemory
83642Leonardo_PaesKralj (COCI16_kralj)C++11
56 / 140
256 ms4480 KiB
#include <bits/stdc++.h> using namespace std; #define MAXN 500001 int d[MAXN], e[MAXN]; int main(){ ios_base::sync_with_stdio(false);cin.tie(NULL); int n, a, resp=0; cin >> n; for(int i=0; i<n; i++){ cin >> a; if(a!=1){ return 0; } } for(int i=0; i<n; i++){ cin>>d[i]; } for(int i=0; i<n; i++){ cin>>e[i]; } sort(d, d+n); sort(e, e+n); for(int i=0, j=0; i<n; i++){ if(e[i]>d[j]){ resp++; j++; } } cout << resp << endl; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...