Submission #27133167


Source Code Expand

#include<bits/stdc++.h>
#define int long long
#define pb push_back
#define mp make_pair
#define x first
#define y second
#define WT int TT=read();while(TT--) 
#define NO puts("NO");
#define YES puts("YES");
using namespace std;

inline int read()
{
    char c=getchar();int x=0;bool f=0;
    for(;!isdigit(c);c=getchar())f^=!(c^45);
    for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
    if(f)x=-x;return x;
}

const int M=2e5+10;
int n,m,a[M],b[M],c[M],sum[M],ans,res1,res2;
vector<int>v[M];

signed main()
{
	n=read(),m=read();
	for (int i=1;i<=n;i++)a[i]=read();
	for (int i=1;i<=m;i++)b[i]=read();
	for (int i=1;i<=m;i++)c[i]=read();
	sort(a+1,a+1+n);
	for (int i=1;i<=n;i++)sum[i]=sum[i-1]+a[i];ans=sum[n];
	for (int i=1;i<=m;i++)
	{
		if ((c[i]-1)/b[i]+1<=n)
			v[(c[i]-1)/b[i]+1].pb(i);
		res2+=b[i];
	}
	for (int i=1;i<=n;i++)
	{
		res1+=res2;
		for (auto p:v[i])
			res1+=-b[p]*i+c[p],res2-=b[p];
		ans=min(ans,res1+sum[n-i]);
	}
	cout<<ans<<endl;
	return 0;
}

Submission Info

Submission Time
Task E - Snack
User pigstd
Language C++ (GCC 9.2.1)
Score 800
Code Size 1020 Byte
Status AC
Exec Time 72 ms
Memory 20768 KiB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:31:2: warning: this ‘for’ clause does not guard... [-Wmisleading-indentation]
   31 |  for (int i=1;i<=n;i++)sum[i]=sum[i-1]+a[i];ans=sum[n];
      |  ^~~
./Main.cpp:31:45: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the ‘for’
   31 |  for (int i=1;i<=n;i++)sum[i]=sum[i-1]+a[i];ans=sum[n];
      |                                             ^~~

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 800 / 800
Status
AC × 2
AC × 27
Set Name Test Cases
Sample 00-sample-001.txt, 00-sample-002.txt
All 00-sample-001.txt, 00-sample-002.txt, 01-001.txt, 01-002.txt, 01-003.txt, 01-004.txt, 01-005.txt, 01-006.txt, 01-007.txt, 01-008.txt, 01-009.txt, 01-010.txt, 01-011.txt, 01-012.txt, 01-013.txt, 01-014.txt, 01-015.txt, 01-016.txt, 01-017.txt, 01-018.txt, 01-019.txt, 01-020.txt, 01-021.txt, 01-022.txt, 01-023.txt, 01-024.txt, 01-025.txt
Case Name Status Exec Time Memory
00-sample-001.txt AC 16 ms 8280 KiB
00-sample-002.txt AC 5 ms 8124 KiB
01-001.txt AC 6 ms 8196 KiB
01-002.txt AC 9 ms 8256 KiB
01-003.txt AC 6 ms 8120 KiB
01-004.txt AC 5 ms 8256 KiB
01-005.txt AC 5 ms 8124 KiB
01-006.txt AC 26 ms 13724 KiB
01-007.txt AC 28 ms 12020 KiB
01-008.txt AC 47 ms 15580 KiB
01-009.txt AC 35 ms 11800 KiB
01-010.txt AC 36 ms 16612 KiB
01-011.txt AC 51 ms 17244 KiB
01-012.txt AC 56 ms 16888 KiB
01-013.txt AC 59 ms 16800 KiB
01-014.txt AC 71 ms 20544 KiB
01-015.txt AC 71 ms 20608 KiB
01-016.txt AC 70 ms 20736 KiB
01-017.txt AC 70 ms 20684 KiB
01-018.txt AC 69 ms 20696 KiB
01-019.txt AC 67 ms 20604 KiB
01-020.txt AC 70 ms 20716 KiB
01-021.txt AC 71 ms 20712 KiB
01-022.txt AC 68 ms 20560 KiB
01-023.txt AC 69 ms 20624 KiB
01-024.txt AC 72 ms 20768 KiB
01-025.txt AC 68 ms 20712 KiB