POJ-牛的选举

#include<iostream>
#include<stdlib.h>
using namespace std;
struct Ele
{
int round_one;
int round_two;
}Cow[50001];
int cmp1(const void *p, const void *q)
{
Ele *p1 = (Ele*)p, *q1 = (Ele*)q; 
if(p1->round_one > q1->round_one)
return -1;
else
return 1;
}
int main()
{
int N,K;
int i;
Ele tmp[50001];
int win_num = 0,win_cow = 0;
cin>>N>>K;
for(i = 0;i < N;i ++)
{
cin>>Cow[i].round_one>>Cow[i].round_two;
tmp[i].round_one = Cow[i].round_one;
tmp[i].round_two = Cow[i].round_two;
}
qsort(Cow,N,sizeof(Ele),cmp1);