蒟蒻求助:样例过了,0分(1RE 2TLE 剩下的全WA)
查看原帖
蒟蒻求助:样例过了,0分(1RE 2TLE 剩下的全WA)
357342
Alex7616楼主2020/8/13 12:26

求助:代码

// P6473 未了NOI Online入门组 
#include <bits/stdc++.h>
using namespace std;

int L, v, a[100010], n, m, q[1000010]; 

int main()
{
	cin >> n >> L >> v;
	for (int i = 1; i <= n; i++)	cin >> a[i];
	cin >> m;
	for (int i = 1; i <= m; i++)	cin >> q[i];
	a[n + 1] = L;
	int ans;
	sort(a + 1, a + n + 1);
	for (int i = 1; i <= m; i++)
	{
		ans = 0;
		int p = n + 1, sum = 0;
		do
		{
			sum += a[p] / v;
			p--;
			ans++;
		}while (sum < q[i] && p >= 1);
		if (sum < q[i])
		{
			cout << -1;
			continue;
		}
		else cout << ans - 1 << endl;
	}
    return 0;
}

2020/8/13 12:26
加载中...