[noj 1555] The Sum of F(x) and G(x)
2014-05-05 17:40
295 查看
签到题。不知道校内赛新生们做的怎么样,虽然有着最高话语权的那个人毁掉了13新生们,不过我带的几个人不被污染就行了,其他就与我无关了-。-
按照指数加一下就行,由于太懒就直接开了个map
按照指数加一下就行,由于太懒就直接开了个map
#include<iostream> #include<cstdio> #include<map> using namespace std; int main() { int n, m; map<int, int> mp; int a, b; while(~scanf("%d%d", &n, &m)) { mp.clear(); for(int i = 0; i < n+m; i++) { scanf("%d%d", &a, &b); mp[b] += a; } map<int, int>::iterator it = mp.end(); for(it--; it != mp.begin(); it--) printf("%d %d\n", it->second, it->first); printf("%d %d\n", it->second, it->first); } return 0; }
相关文章推荐
- NBUT 1555 The Sum of F(x) and G(x)
- NBUT The Sum of F(x) and G(x)
- hdu5381 The sum of gcd
- hdu 5381 The sum of gcd(线段树)
- Educational Codeforces Round 7 F. The Sum of the k-th Powers 拉格朗日插值法
- hdu 5381 The sum of gcd 2015多校联合训练赛#8莫队算法
- 【hdu 5053】the Sum of Cube
- HDOJ 5381 The sum of gcd 莫队算法
- hdu 5053(2014上海网赛1012) the Sum of Cube
- Given an integer array nums, find the sum of the elements between indices i and j (i ≤ j), inclusive
- The direct sum of functions
- the Sum of Cube
- HDU 5381 The sum of gcd 离线处理+线段树
- HDU-#5053 the Sum of Cube
- POJ_2366_SacramentOfTheSum
- 【杭电5053】the Sum of Cube
- POJ 2366 Sacrament of the sum
- 【杭电oj】5053-the Sum of Cube(立方和)
- I - the Sum of Cube
- The direct sum of functions