H - Steaks
https://vjudge.csgrandeur.cn/problem/Gym-102263H
题意:煎 n nn 个牛排,每个牛排有正反面,每一面耗时五分钟,你有k个锅,每个锅最多放入两个牛排,煎熟的最短时间。
#include<bits/stdc++.h>
#define int long long
using namespace std;
signed main()
{
int n,k,sum;
scanf("%lld %lld",&n,&k);
if(n/k<2)
{
sum=10;
}
else
{
if(n%k==0)
sum=n/k*5;
else
sum=(n/k+1)*5;
}
printf("%lld\n",sum);
}
题解: