SDUT 选夫婿1 http://acm.sdut.edu.cn/sdutoj/showproblem.php?pid=1569&cid=1211
2014-01-17 19:25
405 查看
#include<stdio.h> #include<string.h> void main() { char str[20][100]; int n, i, j, k, high[100], weight[100]; int hl, hr, wl, wr, t1, t2, count=0; char t3[100]; scanf("%d", &n); for(i=0; i<n; i++) { scanf("%s", str[i]); scanf("%d %d", &high[i], &weight[i]); } scanf("%d %d %d %d", &hl, &hr, &wl, &wr); for(i=0; i<n-1; i++) for(j=i+1; j<n; j++) { if(high[i]>high[j]) { t1 = high[i]; high[i] = high[j]; high[j] = t1; t2 = weight[i]; weight[i] = weight[j]; weight[j] = t2; strcpy(t3, str[i]); strcpy(str[i], str[j]); strcpy(str[j], t3); } if(high[i]==high[j] && weight[i] > weight[j]) { t2 = weight[i]; weight[i] = weight[j]; weight[j] = t2; strcpy(t3, str[i]); strcpy(str[i], str[j]); strcpy(str[j], t3); } } for(i=0; i<n; i++) { if(high[i] >= hl && high[i] <= hr && weight[i] >= wl && weight[i] <= wr) { printf("%s %d %d\n", str[i], high[i], weight[i]); count++; } } if(count==0) printf("No\n"); }
相关文章推荐
- http://acm.sdut.edu.cn/sdutoj/showproblem.php?pid=2467&cid=1131
- http://acm.sdut.edu.cn/sdutoj/showproblem.php?pid=2500&cid=1122
- 站站排(重温儿时的游戏) http://acm.sdut.edu.cn/sdutoj/showproblem.php?pid=1573&cid=1211
- 站站排(重温儿时的游戏) http://acm.sdut.edu.cn/sdutoj/showproblem.php?pid=1573&cid=1211
- http://acm.sdut.edu.cn/sdutoj/showproblem.php?pid=2504&cid=1122
- SDUT 选夫婿1 http://acm.sdut.edu.cn/sdutoj/showproblem.php?pid=1569&cid=1211
- http://acm.sdut.edu.cn/sdutoj/showproblem.php?pid=2502&cid=1122
- SDUT 选夫婿1 http://acm.sdut.edu.cn/sdutoj/showproblem.php?pid=1569&cid=1211
- KMP(http://acm.sdut.edu.cn/sdutoj/problem.php?action=showproblem&problemid=2772)
- http://acm.sdut.edu.cn/sdutoj/problem.php?action=showproblem&problemid=2633
- 站站排(重温儿时的游戏) http://acm.sdut.edu.cn/sdutoj/showproblem.php?pid=1573&cid=1211
- http://acm.hdu.edu.cn/webcontest/contest_showproblem.php?cid=963&pid=1019&ojid=1
- http://acm.hdu.edu.cn/webcontest/contest_showproblem.php?cid=791&pid=1001&ojid=0
- http://acm.hdu.edu.cn/webcontest/contest_showproblem.php?pid=1004&ojid=1&cid=6866&hide=1&problem=Pro
- Computer Transformation&&http://acm.hdu.edu.cn/showproblem.php?pid=1041
- Hello Kiki&&http://acm.hdu.edu.cn/showproblem.php?pid=3579
- 完数 &&http://acm.hdu.edu.cn/showproblem.php?pid=1406
- http://acm.hdu.edu.cn/showproblem.php?pid=1269&&迷宫城堡
- http://acm.hdu.edu.cn/showproblem.php?pid=1106&&排序
- Quoit Design&&http://acm.hdu.edu.cn/showproblem.php?pid=1007