Codeforces Round #217 (Div. 2) / 370C Mittens (构造&贪心)
2014-03-14 20:07
369 查看
http://codeforces.com/contest/370/problem/C
/*31ms,0KB*/ #include<iostream> #include<algorithm> using namespace std; int C[5005]; int main() { int N, M; cin >> N >> M; for (int i = 0; i < N; i++) cin >> C[i]; sort(C, C + N); int cnt = 0; for (int i = 0; i < N; i++) cnt += (C[i] != C[(i + N / 2) % N]); cout << cnt << endl; for (int i = 0; i < N; i++) cout << C[i] << ' ' << C[(i + N / 2) % N] << endl; return 0; }
相关文章推荐
- Codeforces Round #459 (Div. 2) C.The Monster【贪心&括号匹配】
- Codeforces Round #419 (Div. 2)-贪心&思维-C. Karen and Game
- Codeforces Round #377 (Div. 2) D. Exams && codeforce 732 D 详解(贪心+二分)
- Codeforces Round #444 (Div. 2)-贪心&尺取-Ratings and Reality Shows
- Codeforces Round #196 (Div. 2) / 337C Quiz (贪心&快速幂取模)
- Codeforces #245 (Div. 2)C. Xor-tree(DFS&&贪心
- Codeforces Round #387 (Div. 2) D && coedeforces 744 D. Winter Is Coming(贪心)
- Codeforces Round #428 (Div. 2)-贪心&模拟-B. Game of the Rows
- HDU5285:wyh2000 and pupil(二分图染色 & 贪心)
- Codeforces Round #428 (Div. 2) B.Game of the Rows(贪心+炒鸡多坑的模拟)
- <div+css页面布局课堂笔记>7---登录和注册界面的实现
- Codeforces Round #436 (Div. 2) D. Make a Permutation! 思维+贪心
- HDU 2126 Buy the souvenirs (贪心&0-1背包最优解的个数)
- Codeforces Round #383 (Div. 1) C. Arpa’s overnight party and Mehrdad’s silent entering(贪心,二分图)
- Codeforces Round #390 (Div. 2)(A,B,C(记忆化搜索),D(贪心,优先队列))
- FZU 2102 Solve equation(水,进制转化)&& FZU 2111(贪心,交换使数字最小)
- 如何使一个div能够铺满整个页面? && 模态框的制作 && outerHTML
- Codeforces Round #433 (Div. 2)A&B
- pid=1009 FatMouse' Trade - 简单贪心
- Codeforces Round #256 (Div. 2) C. Painting Fence(分治+贪心)(好题)