Election Time
来源:互联网 发布:淘宝客服交流技巧 编辑:程序博客网 时间:2024/05/16 11:34
#include <cstdio>
#include <algorithm>
using namespace std;
struct cow
{
int vote1;
int vote2;
int id;
bool operator < (const cow& A) const
{
return this->vote1 < A.vote1;
}
}
cow[50050];
int main()
{
int n,k;
scanf("%d %d",&n,&k);
for(int i =0 ;i<n;i++)
{
int v1,v2;
scanf("%d %d",&v1,&v2);
cow[i].id=i+1;
cow[i].vote1=v1;
cow[i].vote2=v2;
}
sort(cow,cow+n);
int maxCow=0,maxId=0;
for(int i = n-1;i>=n-k;i--)
{
if(cow[i].vote2>maxCow)
{
maxCow=cow[i].vote2;
maxId=cow[i].id;
}
}
printf("%d",maxId);
}
#include <algorithm>
using namespace std;
struct cow
{
int vote1;
int vote2;
int id;
bool operator < (const cow& A) const
{
return this->vote1 < A.vote1;
}
}
cow[50050];
int main()
{
int n,k;
scanf("%d %d",&n,&k);
for(int i =0 ;i<n;i++)
{
int v1,v2;
scanf("%d %d",&v1,&v2);
cow[i].id=i+1;
cow[i].vote1=v1;
cow[i].vote2=v2;
}
sort(cow,cow+n);
int maxCow=0,maxId=0;
for(int i = n-1;i>=n-k;i--)
{
if(cow[i].vote2>maxCow)
{
maxCow=cow[i].vote2;
maxId=cow[i].id;
}
}
printf("%d",maxId);
}
阅读全文
0 0
- Election Time
- Election Time
- pku3664 Election Time
- poj 3664 Election Time
- BNUOJ 14362 Election Time
- POJ_3664 Election Time
- POJ 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 题解
- POJ3664——Election Time
- POJ 3664 Election Time 再想想
- Election
- Election
- poj——3664——Election Time
- T1 hyf的赌约
- “Beginning Python”(六)“Plot”
- STM32菜鸟成长记录---RS485通讯协议的应用
- vim编辑器
- 罗斯柴尔德
- Election Time
- SvcUtil.exe 生成的代理类与别人生成的不同原因
- 关闭SELinux
- c#设计模式之责任链模式
- BZOJ 1060 时态同步
- 原码 补码 反码
- 切片
- 文本溢出的处理
- 转:系统吞吐量(TPS)、用户并发量、性能测试概念和公式