# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
826506 | dijbkr | Just Long Neckties (JOI20_ho_t1) | C++14 | 353 ms | 27920 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>
typedef long long ll;
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
int n;
cin >> n;
pair<int,int>a[n+4];
int b[n+4];
for (int i=1; i<=n+1; i++) {
cin >> a[i].first;
a[i].second=i;
}
sort(a+1,a+n+1+1);
// for (int i=1; i<=n+1; i++) {
// cout << a[i].first << " " << a[i].second << endl;
// }
for (int i=1; i<=n; i++) {
cin >> b[i];
}
sort(b+1,b+n+1);
multiset<int>s;
int ans[n+4];
map<int,int>mp;
for (int i=2; i<=n+1; i++) {
s.insert(max(a[i].first-b[i-1],0));
mp[i]=i-1;
//cout << *--s.end();
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |