Devu, the Singer and Churu, the Joker
Devu is a renowned classical singer. He is invited to many big functions/festivals. Recently he was invited to "All World Classical Singing Festival". Other than Devu, comedian Churu was also invited.
Devu has provided organizers a list of the songs and required time for singing them. He will sing n songs, ith song will take ti minutes exactly.
The Comedian, Churu will crack jokes. All his jokes are of 5 minutes exactly.
People have mainly come to listen Devu. But you know that he needs rest of 10 minutes after each song. On the other hand, Churu being a very active person, doesn't need any rest.
You as one of the organizers should make an optimal sсhedule for the event. For some reasons you must follow the conditions:
- The duration of the event must be no more than d minutes;
- Devu must complete all his songs;
- With satisfying the two previous conditions the number of jokes cracked by Churu should be as many as possible.
If it is not possible to find a way to conduct all the songs of the Devu, output -1. Otherwise find out maximum number of jokes that Churu can crack in the grand event.
Input
The first line contains two space separated integers n, d (1 ≤ n ≤ 100; 1 ≤ d ≤ 10000). The second line contains n space-separated integers: t1, t2, ..., tn (1 ≤ ti ≤ 100).
Output
If there is no way to conduct all the songs of Devu, output -1. Otherwise output the maximum number of jokes that Churu can crack in the grand event.
Examples
Input
3 30 2 2 1
Output
5
Input
3 20 2 1 1
Output
-1
Note
Consider the first example. The duration of the event is 30 minutes. There could be maximum 5 jokes in the following way:
- First Churu cracks a joke in 5 minutes.
- Then Devu performs the first song for 2 minutes.
- Then Churu cracks 2 jokes in 10 minutes.
- Now Devu performs second song for 2 minutes.
- Then Churu cracks 2 jokes in 10 minutes.
- Now finally Devu will perform his last song in 1 minutes.
Total time spent is 5 + 2 + 10 + 2 + 10 + 1 = 30 minutes.
Consider the second example. There is no way of organizing Devu's all songs. Hence the answer is -1.
问题链接:https://vjudge.net/problem/CodeForces-439A
题意:Devu演唱n首歌曲,每首歌曲分别是(t1,t2,t3……tn)分钟,每唱一首歌需要休息十分钟,Churu每讲一个笑话是五分钟。令Devu完成所有歌曲,且不得超过d分钟,令Churu讲的笑话尽可能地多。
解决方案:
定义一个数组存放Devu唱的每首歌的所需时间,
则Devu的休息时间有j=(n-1)*10分钟,
即Churu讲笑话的时间也有sum=(n-1)*10分钟,
总的花费时间为 数组所有元素与j之和.
如果所给时间少于所需时间,输出"-1";否则输出Churu所讲笑话个数.
AC代码:
#include <iostream>
using namespace std;
int main()
{
int n, d;
while (cin >> n >> d)
{
int i, j, sum;
int a[100];
for (i = 0;i < n;i++)
{
cin >> a[i];
}
j = (n - 1) * 10;
sum = j;
for (i = 0;i < n;i++)
{
sum = sum + a[i];
}
if (d < sum)cout << "-1";
else cout << (d - sum) / 5 + j / 5;
}
}