HDU Fighting for HDU
来源:互联网 发布:惠州市网络问政查询 编辑:程序博客网 时间:2024/05/04 06:58
注意n是变量
#include <stdio.h>
#include <stdlib.h>using namespace std;
int cmp(const void* s1,const void* s2)
{
int * p1;
int * p2;
p1 = (int *)s1;
p2 = (int *)s2;
return *p1-*p2;
}
int main()
{
int n,i,k;
while(scanf("%d",&n)&&n){
int c[n];
int j[n];
for(i = 0;i < n;i++){
scanf("%d",&c[i]);
}
for(k = 0;k < n;k++){
scanf("%d",&j[k]);
}
qsort(c,n,sizeof(int),cmp);
qsort(j,n,sizeof(int),cmp);
int csum=0;
int jsum = 0;
for(int i = 0;i < n;i++)
{
if(c[i]>j[i])
{
csum +=2;
}
if(c[i]==j[i])
{
csum +=1;
jsum +=1;
}
if(c[i]<j[i])
{
jsum +=2;
}
}
printf("%d vs %d\n",csum,jsum);
}
return 0;
}
- HDU Fighting for HDU
- Fighting for HDU 2109
- Fighting for HDU
- Fighting for HDU
- HDU2109 Fighting for HDU
- Fighting for HDU
- HDOJ2109 Fighting for HDU
- HDU 2109 Fighting For HDU
- HDU 2109 Fighting for HDU
- hdu 2109 Fighting for HDU
- hdu-2109-Fighting for HDU
- HDU 2109 Fighting for HDU
- HDU-2109-Fighting for HDU
- hdu 2109 (Fighting for HDU)
- hdu 2109 Fighting for HDU
- hdoj 2109 Fighting for HDU
- HDU2109 Fighting for HDU【水题】
- hdoj-2109-Fighting for HDU
- 网页视频播放器js代码
- LPBYTE\LPSTR
- heap corruption
- 进程页表图示
- 各国安规标识
- HDU Fighting for HDU
- python发送HTTP GET请求
- windows 8之新体验
- 组合数的输出
- hdu 3486(RMQ应用)
- eclipse 快捷 tips
- 面向对象哀悼会
- directfb/gtk的鼠标问题 no-cursor-updates
- 北航计算机学院2012年接收外校推荐免试攻读硕士学位研究生的暂行办法