(简单模拟2.1.2)POJ 1922 Ride to School(求最小值)
2013-12-15 12:54
525 查看
/* * POJ_1922.cpp * * Created on: 2013年10月24日 * Author: Administrator */ #include <iostream> #include <cstdio> #include <cmath> using namespace std; int main(){ int n; while(scanf("%d",&n)!=EOF,n){ int i; double min = INT_MAX; for(i = 0 ; i < n ; ++i){ int v,t; scanf("%d%d",&v,&t); double x; if(t >= 0 && (x = t + 4.5/v*3600)<min ){//t < 0 时不能影响操作结果,因为他已经出发 min = x; } } printf("%d\n",(int)ceil(min)); } return 0; }
相关文章推荐
- POJ 1922 Ride to School 简单模拟
- POJ 1922 Ride to School(贪心+模拟)
- POJ-1922 Ride to School
- Ride to School - POJ 1922 水题
- POJ 1922 Ride to School
- POJ 1922 Ride to School
- POJ 1922 Ride to School#贪心
- POJ 1922 - Ride to School
- POJ 1922 Ride to School 解题报告
- POJ1922 Ride to School
- POJ 1922 Ride to School
- POJ 1922:Ride to School 【水】
- POJ 1922 Ride to School
- POJ 1922 Ride to School (贪心)
- POJ 1922 Ride to School G++
- POJ 1922:Ride to School:水题练java
- poj 1922 Ride to School
- poj 1922 Ride to School
- POJ1922-Ride To School (C语言实现)
- POJ 1922 Ride to School