# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
89491 | antimirage | Gift (IZhO18_nicegift) | C++17 | 870 ms | 137560 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>
#define pb emplace_back
#define mk make_pair
#define fr first
#define sc second
using namespace std;
const int N = 1e6 + 5;
int n, k, sz, l[N];
long long sum, ar[N], mx, cn, mn[N];
vector < pair <long long, int> > vec[N];
vector < vector <int> > ans;
main()
{
cin >> n >> k;
for (int i = 1; i <= n; i++)
scanf("%lld", &ar[i]), sum += ar[i], mx = max(mx, ar[i]);
if (mx > sum / k || sum % k != 0){
puts("-1");
return 0;
}
sum /= k;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |