Codeforces Round #246 (Div. 2) A. Choosing Teams
来源:互联网 发布:异步网络请求的好处 编辑:程序博客网 时间:2024/04/28 06:27
排个序,对每个队的尾判断一下,贪心水题
#include<cstdio>#include<algorithm>using namespace std;int a[2010];int main(){ int n,k; scanf("%d %d",&n,&k); for(int i=0;i<n;i++) scanf("%d",&a[i]); sort(a,a+n); int num=0; for(int i=2;i<n;i+=3) { if((a[i]+k)<=5) num++; } printf("%d\n",num); return 0;}
0 0
- Codeforces Round #246 (Div. 2) - A. Choosing Teams
- Codeforces Round #246 (Div. 2) A. Choosing Teams
- Codeforces Round #246 (Div. 2):A. Choosing Teams
- Codeforces Round #246 (Div. 2) A. Choosing Teams
- Codeforces #246 (Div. 2) A. Choosing Teams
- Codeforces #246 (Div. 2) A. Choosing Teams
- Codeforces 432A Choosing Teams
- Codeforces 432 A. Choosing Teams
- Codeforces 432A Choosing Teams
- CF 246 A Choosing Teams
- Codeforces 432A Choosing Teams(水题)
- A. Choosing Teams
- Codeforces Round #135 (Div. 2)VD. Choosing Capital for Treeland
- Codeforces Round #135 (Div. 2) D Choosing Capital for Treeland
- Codeforces Round #135 (Div. 2) D. Choosing Capital for Treeland
- Codeforces Round #135 (Div. 2) D. Choosing Capital for Treeland
- Codeforces Round #135 (Div. 2)-D. Choosing Capital for Treeland
- Codeforces Round #273 (Div. 2) --B Random Teams
- 黑马程序员—java基础_面向对象2
- 对于hashCode和equals的一些理解
- Android 网络操作学习HttpURLConnection与HttpClient及网络框架选择
- PHP链接数据库
- JavaScript--什么是JavaScript
- Codeforces Round #246 (Div. 2) A. Choosing Teams
- java Fork/Join框架介绍
- 栅栏实例
- SQL优化
- Android的ViewDragHelper源码解析
- 最优服务次序问题
- 说好的30天直播生死呢?--第三章 我所理解的打击感(一)
- sp,lr,pc即汇编语言中几个常见寄存器的使用
- SQL多表查询分析