1062. Talent and Virtue (25) 大量输入输出 scanf printf会比cin cout 省很多时间
2018-03-01 01:23
501 查看
#include <iostream> #include <vector> #include <algorithm> using namespace std; struct node{ int id, v, t, g; }; vector<node> v[4]; int cmp(node &a, node &b) { if (a.g != b.g) return a.g > b.g; else if (a.v != b.v) return a.v > b.v; else return a.id < b.id; } void Sort(vector<node> &a){ sort(a.begin(), a.end(), cmp); } void print(vector<node> &a){ Sort(a); for (int i = 0; i < a.size(); i++) printf("%d %d %d\n", a[i].id, a[i].v, a[i].t); } int main() { int n, l, h, cnt; cin >> n >> l >> h; cnt = n; for (int i = 0; i < n; i++) { int id, vi, t; scanf("%d %d %d", &id, &vi, &t); if (vi >= l && t >= l){ node temp{id, vi, t, vi+t}; if(vi >= h && t >= h) v[0].push_back(temp); else if(vi >= h && t < h) v[1].push_back(temp); else if(vi < h && t < h && vi >= t) v[2].push_back(temp); else v[3].push_back(temp); }else cnt--; } cout << cnt << endl; for (int i = 0; i < 4; i++) print(v[i]); return 0; }
相关文章推荐
- PAT (Advanced Level) Practise 1062 Talent and Virtue (25)
- 1062. Talent and Virtue (25)
- 1062. Talent and Virtue (25)【排序】——PAT (Advanced Level) Practise
- 1062. Talent and Virtue (25)
- scanf printf 与cin cout 时间的差别
- 1062.Talent and Virtue (25)
- pat 1062. Talent and Virtue (25)
- PAT (Advanced Level) Practise 1062 Talent and Virtue (25)
- PAT 1062. Talent and Virtue (25)
- 1062. Talent and Virtue (25)【排序】——PAT (Advanced Level) Practise
- PAT甲题题解-1062. Talent and Virtue (25)-排序水题
- 1062. Talent and Virtue (25)
- 1062. Talent and Virtue (25)
- 1062. Talent and Virtue (25)
- PAT-A-1062. Talent and Virtue (25)
- 1062. Talent and Virtue (25)
- eclipse C/C+ CDT中scanf、cin、 printf、cout不能debug输入输出的问题
- 1062. Talent and Virtue (25)
- 1062. Talent and Virtue (25)
- PAT 1062. Talent and Virtue (25)(判断是否是圣人君子小人)(代码超时)