pku3664 Election Time
2013-07-27 19:35
246 查看
http://poj.org/problem?id=3664
水题
水题
#include <stdio.h> #include <map> using namespace std; map<pair<int, int>, int> map1; map<pair<int, int>, int>::iterator it; int main() { int n, k; int i, x, y, max1, flag1, temp; while(~scanf("%d%d", &n, &k)) { map1.clear(); max1 = 0; flag1 = 1; for(i=1; i<=n; i++) { scanf("%d %d", &x, &y); map1.insert(make_pair(make_pair(x, y), i)); if(map1.size() > k) { map1.erase(map1.begin()); } } for(it=map1.begin(); it!=map1.end(); it++) { temp = ((*it).first).second; if(temp > max1) { max1 = temp; flag1 = (*it).second; } } printf("%d\n", flag1); } return 0; }
相关文章推荐
- pku3664 Election Time
- POJ 3664 Election Time 题解
- POJ_3664 Election Time
- poj 3664 Election Time
- POJ 3664 Election Time
- POJ 3664----Election Time
- POJ 3664 Election Time
- poj 3664 Election Time
- poj 3664 Election Time
- POJ3664——Election Time
- POJ 3664 Election Time 再想想
- (Relax ST1.22)POJ 3664 Election Time(两次排序的巧妙应用)
- POJ 3664 Election Time(简单的快速排序)
- poj——3664——Election Time
- Pku3664
- Pku3664
- POJ 3664 Election Time 题解
- PKU1061
- MST pku 1258 Agri-Net
- PKU 3259-Wormholes