HDU Saving
来源:互联网 发布:王珊数据库第五版ppt 编辑:程序博客网 时间:2024/06/03 14:58
#include<stdio.h>
struct msg
{
int pi;
double mi;
}s[100],t;
int main()
{
int n, i, j, sum;
double v;
while(scanf("%lf%d",&v,&n)!=EOF)
{
if(v==0)break;
for(i=0;i<n;i++)
{
scanf("%d%lf",&s[i].pi,&s[i].mi);
}
for(i=0; i<n-1; i++)
{
for(j=0; j<n-i-1; j++)
{
if(s[j].pi<s[j+1].pi)
{
t = s[j];
s[j] = s[j+1];
s[j+1] = t;
}
}
}
sum=0;
for(j=0;j<n;j++)
{
if(v>=s[j].mi)
{
v=v-s[j].mi;
sum += s[j].pi * s[j].mi;
}
else
{
sum += s[j].pi * v;
break;
}
}
printf("%d\n",sum);
}
}
struct msg
{
int pi;
double mi;
}s[100],t;
int main()
{
int n, i, j, sum;
double v;
while(scanf("%lf%d",&v,&n)!=EOF)
{
if(v==0)break;
for(i=0;i<n;i++)
{
scanf("%d%lf",&s[i].pi,&s[i].mi);
}
for(i=0; i<n-1; i++)
{
for(j=0; j<n-i-1; j++)
{
if(s[j].pi<s[j+1].pi)
{
t = s[j];
s[j] = s[j+1];
s[j+1] = t;
}
}
}
sum=0;
for(j=0;j<n;j++)
{
if(v>=s[j].mi)
{
v=v-s[j].mi;
sum += s[j].pi * s[j].mi;
}
else
{
sum += s[j].pi * v;
break;
}
}
printf("%d\n",sum);
}
}
0 0
- Saving HDU
- Saving HDU
- Saving HDU
- Saving HDU
- Saving HDU
- Saving HDU
- Saving HDU
- Saving HDU
- HDU Saving
- Saving HDU
- Saving HDU
- Saving HDU
- Saving HDU
- saving HDU
- Saving HDU
- Saving HDU
- Saving HDU
- Saving HDU
- PLY文件格式及其MATLAB读写操作
- Untiy Native Render Plugin在VR中的绘制(二): 透明排序
- LeetCode 141. Linked List Cycle
- bzoj2150 部落战争
- CentOS下使用yum安装Git具体步骤
- HDU Saving
- Leetcode--Maximum Product of Word Lengths
- 调用C++11编译器 //支持c++11
- 数据结构复习——堆
- SPOJ DETER3 Find The Determinant III(求行列式的秩、高斯消元)
- Bill Emacs速查手册
- iOS学习之加载storyboard和xib文件
- 算法资料
- 触发器:实际工作中创建脚本时用到的