170952025-05-22 16:57:52ercseferencMaximális szorzat (50 pont)cpp17Wrong answer 29/5057ms808 KiB
#include <bits/stdc++.h>
using namespace std;
int main()
{
    int n,b; long long k; //ifstream f("szamok.txt");
    cin>>n>>k>>b; vector<int>a(n);
    for(int i=0; i<n; i++)cin>>a[i];
    sort(a.begin(),a.end());
    long long s=0,t=b;
    if(n==b)t=0;
    while(k>s+(a[t]-a[t-1])*(t-b) && t<n){
        s+=(a[t]-a[t-1])*(t-b);
        t++;}
    for(int i=b; i<t; i++)a[i]=a[t-1];
    k-=s;
    for(int i=b; i<t; i++)a[i]+=k/(t-b);
    k=k%(t-b);
    for(int i=b; i<b+k; i++)a[i]++;
    s=1; int mod=1000000007;
    for(int i=0; i<n; i++)s=(s*a[i])%mod;
    if(a[b]>=0 && a[b-1]<0)cout<<s;
    else cout<<-1;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base29/50
1Wrong answer0/01ms316 KiB
2Wrong answer0/01ms316 KiB
3Accepted0/01ms316 KiB
4Accepted0/01ms316 KiB
5Accepted0/04ms440 KiB
6Wrong answer0/21ms316 KiB
7Wrong answer0/21ms320 KiB
8Wrong answer0/21ms316 KiB
9Wrong answer0/21ms316 KiB
10Wrong answer0/24ms316 KiB
11Wrong answer0/250ms564 KiB
12Wrong answer0/154ms800 KiB
13Accepted1/11ms316 KiB
14Accepted1/14ms316 KiB
15Accepted1/120ms568 KiB
16Accepted1/121ms456 KiB
17Accepted1/120ms608 KiB
18Wrong answer0/19ms564 KiB
19Wrong answer0/141ms804 KiB
20Wrong answer0/129ms564 KiB
21Wrong answer0/157ms564 KiB
22Wrong answer0/124ms564 KiB
23Accepted1/157ms804 KiB
24Accepted1/154ms800 KiB
25Accepted2/21ms508 KiB
26Accepted2/24ms316 KiB
27Wrong answer0/228ms564 KiB
28Wrong answer0/128ms808 KiB
29Accepted2/223ms564 KiB
30Accepted1/157ms800 KiB
31Accepted1/141ms760 KiB
32Accepted2/21ms316 KiB
33Accepted2/257ms564 KiB
34Accepted1/157ms564 KiB
35Accepted2/257ms800 KiB
36Accepted2/257ms564 KiB
37Accepted2/257ms568 KiB
38Accepted2/257ms564 KiB
39Accepted1/11ms316 KiB