# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
160622 | 44442 | Jarvis (COCI19_jarvis) | C++11 | 93 ms | 8056 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
long long n,a[100004],b[100004],maxx,c,e,d;
multiset<long long>s;
int main (){
ios::sync_with_stdio(0);
scanf("%lld\n",&n);
for(int i=0;i<n;i++){
scanf("%lld",&a[i]);
}
for(int i=0;i<n;i++){
scanf("%lld",&b[i]);
c=b[i]-a[i];
s.insert(c);
}
multiset<long long>::iterator it;
while(!s.empty()){
d=s.size();
it=s.begin();
s.erase(*it);
e=s.size();
maxx=max(maxx,d-e);
}
printf("%lld",maxx);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |