首页 > 代码库 > Pku3664
Pku3664
<span style="color:#6600cc;">/* D - Election Time Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u Submit Status Description The cows are having their first election after overthrowing the tyrannical Farmer John, and Bessie is one of N cows (1 ¡Ü N ¡Ü 50,000) running for President. Before the election actually happens, however, Bessie wants to determine who has the best chance of winning. The election consists of two rounds. In the first round, the K cows (1 ¡Ü K ¡Ü N) cows with the most votes advance to the second round. In the second round, the cow with the most votes becomes President. Given that cow i expects to get Ai votes (1 ¡Ü Ai ¡Ü 1,000,000,000) in the first round and Bi votes (1 ¡Ü Bi ¡Ü 1,000,000,000) in the second round (if he or she makes it), determine which cow is expected to win the election. Happily for you, no vote count appears twice in the Ai list; likewise, no vote count appears twice in the Bi list. Input * Line 1: Two space-separated integers: N and K * Lines 2..N+1: Line i+1 contains two space-separated integers: Ai and Bi Output * Line 1: The index of the cow that is expected to win the election. Sample Input 5 3 3 10 9 2 5 6 8 4 6 5 Sample Output 5 BY Grant Yuan 2014.7.11 */ #include<iostream> #include<stdio.h> #include<stdlib.h> #include<string.h> using namespace std; int m,k; typedef struct{ long long f; long long s; int m; }vote; vote v[50001]; void Qsort(vote a[],int left,int right) { int key=a[left].f,i=left,j=right+1,t,l; if(left<right){ while(1){ while(i<j&&a[--j].f<key); while(i<j&&a[++i].f>key); if(i>=j)break; t=a[j].f; a[j].f=a[i].f;a[i].f=t; t=a[j].s; a[j].s=a[i].s;a[i].s=t; t=a[j].m; a[j].m=a[i].m;a[i].m=t; } t=a[left].f;a[left].f=a[j].f;a[j].f=t; t=a[left].s;a[left].s=a[j].s;a[j].s=t; t=a[left].m;a[left].m=a[j].m;a[j].m=t; Qsort(a,left,i-1); Qsort(a,i+1,right);} } int main() { int max; cin>>m>>k; for(int i=0;i<m;i++) { cin>>v[i].f>>v[i].s; v[i].m=i;} Qsort(v,0,m); max=0; for(int i=1;i<k;i++) if(v[i].s>v[max].s) max=i; cout<<v[max].m+1<<endl; return 0; } </span>
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。