# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
749493 | 2023-05-28T05:58:49 Z | 반딧불(#9967) | Fruits (NOI22_fruits) | C++17 | 115 ms | 14668 KB |
#include <bits/stdc++.h> using namespace std; typedef long long ll; int n; int arr[400002]; ll cost[400002]; int main(){ scanf("%d", &n); for(int i=1; i<=n; i++) scanf("%d", &arr[i]); for(int i=1; i<=n; i++) scanf("%lld", &cost[i]); sort(cost+1, cost+n+1); reverse(cost+1, cost+n+1); ll sum = 0; for(int i=1; i<=n; i++) printf("%lld ", sum += cost[i]); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 212 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Correct | 1 ms | 452 KB | Output is correct |
3 | Correct | 6 ms | 980 KB | Output is correct |
4 | Correct | 56 ms | 7584 KB | Output is correct |
5 | Correct | 115 ms | 14668 KB | Output is correct |
6 | Correct | 0 ms | 212 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 212 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 212 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 96 ms | 9804 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 212 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |