#include <bits/stdc++.h>
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
//#define int long long
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int mod = 1e9 + 7;
const int LOG = 20;
const int maxn = 1e5 + 5;
const double eps = 1e-9;
int32_t main() {
int n;
cin >> n;
vector<pii> a(n+1); int id = 0;
vector<int> b(n), ans(n+1);
for(auto &x : a) cin >> x.first, x.second = id++;
for(int &x : b) cin >> x;
sort(a.begin(), a.end());
sort(b.begin(), b.end());
for(int i=0; i<n+1; i++) {
int curr = 0, j=0, k=0;
while(j < n + 1 && k < n) {
if(j == i) {
j++;
continue;
}
curr = max(curr, max(a[j].first - b[k], 0));
j++, k++;
}
ans[a[i].second] = curr;
}
for(int &x : ans) cout << x << " ";
return 0;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Correct |
0 ms |
348 KB |
Output is correct |
| 5 |
Correct |
0 ms |
348 KB |
Output is correct |
| 6 |
Correct |
0 ms |
348 KB |
Output is correct |
| 7 |
Correct |
0 ms |
348 KB |
Output is correct |
| 8 |
Correct |
0 ms |
436 KB |
Output is correct |
| 9 |
Correct |
0 ms |
348 KB |
Output is correct |
| 10 |
Correct |
0 ms |
344 KB |
Output is correct |
| 11 |
Correct |
0 ms |
344 KB |
Output is correct |
| 12 |
Correct |
0 ms |
348 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Correct |
0 ms |
348 KB |
Output is correct |
| 5 |
Correct |
0 ms |
348 KB |
Output is correct |
| 6 |
Correct |
0 ms |
348 KB |
Output is correct |
| 7 |
Correct |
0 ms |
348 KB |
Output is correct |
| 8 |
Correct |
0 ms |
436 KB |
Output is correct |
| 9 |
Correct |
0 ms |
348 KB |
Output is correct |
| 10 |
Correct |
0 ms |
344 KB |
Output is correct |
| 11 |
Correct |
0 ms |
344 KB |
Output is correct |
| 12 |
Correct |
0 ms |
348 KB |
Output is correct |
| 13 |
Correct |
1 ms |
348 KB |
Output is correct |
| 14 |
Correct |
2 ms |
348 KB |
Output is correct |
| 15 |
Correct |
4 ms |
348 KB |
Output is correct |
| 16 |
Correct |
0 ms |
348 KB |
Output is correct |
| 17 |
Correct |
5 ms |
348 KB |
Output is correct |
| 18 |
Correct |
4 ms |
348 KB |
Output is correct |
| 19 |
Correct |
4 ms |
348 KB |
Output is correct |
| 20 |
Correct |
4 ms |
348 KB |
Output is correct |
| 21 |
Correct |
4 ms |
344 KB |
Output is correct |
| 22 |
Correct |
4 ms |
348 KB |
Output is correct |
| 23 |
Correct |
4 ms |
344 KB |
Output is correct |
| 24 |
Correct |
4 ms |
348 KB |
Output is correct |
| 25 |
Correct |
5 ms |
348 KB |
Output is correct |
| 26 |
Correct |
5 ms |
348 KB |
Output is correct |
| 27 |
Correct |
5 ms |
344 KB |
Output is correct |
| 28 |
Correct |
5 ms |
348 KB |
Output is correct |
| 29 |
Correct |
4 ms |
348 KB |
Output is correct |
| 30 |
Correct |
5 ms |
348 KB |
Output is correct |
| 31 |
Correct |
5 ms |
348 KB |
Output is correct |
| 32 |
Correct |
7 ms |
348 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Correct |
0 ms |
348 KB |
Output is correct |
| 5 |
Correct |
0 ms |
348 KB |
Output is correct |
| 6 |
Correct |
0 ms |
348 KB |
Output is correct |
| 7 |
Correct |
0 ms |
348 KB |
Output is correct |
| 8 |
Correct |
0 ms |
436 KB |
Output is correct |
| 9 |
Correct |
0 ms |
348 KB |
Output is correct |
| 10 |
Correct |
0 ms |
344 KB |
Output is correct |
| 11 |
Correct |
0 ms |
344 KB |
Output is correct |
| 12 |
Correct |
0 ms |
348 KB |
Output is correct |
| 13 |
Correct |
1 ms |
348 KB |
Output is correct |
| 14 |
Correct |
2 ms |
348 KB |
Output is correct |
| 15 |
Correct |
4 ms |
348 KB |
Output is correct |
| 16 |
Correct |
0 ms |
348 KB |
Output is correct |
| 17 |
Correct |
5 ms |
348 KB |
Output is correct |
| 18 |
Correct |
4 ms |
348 KB |
Output is correct |
| 19 |
Correct |
4 ms |
348 KB |
Output is correct |
| 20 |
Correct |
4 ms |
348 KB |
Output is correct |
| 21 |
Correct |
4 ms |
344 KB |
Output is correct |
| 22 |
Correct |
4 ms |
348 KB |
Output is correct |
| 23 |
Correct |
4 ms |
344 KB |
Output is correct |
| 24 |
Correct |
4 ms |
348 KB |
Output is correct |
| 25 |
Correct |
5 ms |
348 KB |
Output is correct |
| 26 |
Correct |
5 ms |
348 KB |
Output is correct |
| 27 |
Correct |
5 ms |
344 KB |
Output is correct |
| 28 |
Correct |
5 ms |
348 KB |
Output is correct |
| 29 |
Correct |
4 ms |
348 KB |
Output is correct |
| 30 |
Correct |
5 ms |
348 KB |
Output is correct |
| 31 |
Correct |
5 ms |
348 KB |
Output is correct |
| 32 |
Correct |
7 ms |
348 KB |
Output is correct |
| 33 |
Execution timed out |
1058 ms |
6980 KB |
Time limit exceeded |
| 34 |
Halted |
0 ms |
0 KB |
- |
