# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
168942 | abil | Gift (IZhO18_nicegift) | C++14 | 810 ms | 149160 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 fr first
#define sc second
#define pb push_back
#define mk make_pair
#define all(s) s.begin(),s.end()
#define int long long
using namespace std;
const int N = (1e6 + 12);
const int mod = (1e9 + 7);
const int INF = (1e18 + 12);
int a[N], b[N];
vector<pair<int,int > > vec[N];
vector<int > ans[N];
int res[N];
main()
{
int n, k, sum = 0, mx = 0;
scanf("%lld%lld", &n, &k);
for(int i = 1;i <= n; i++){
scanf("%lld", &a[i]);
sum += a[i];
mx = max(mx, a[i]);
}
if(sum % k != 0 || mx > 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... |