[USACO 2009 Mar B]The Perfect Cow

For the 39th year in a row, Farmer John was named "Dairy Farmer of the Year". The Dairy Association wants him to exhibit his most perfect cow at the upcoming Cow Convention in Herbster, Wisconsin on the frigid shores of Lake Superior.
FJ keeps up with scientific literature and knows that beauty is actually a trend toward the average rather than the existence of some superior trait. Thus, he wants to find his most average cow and share her beauty with the other Dairy Farmers during the weekend of revelry and partying at the convention.
Happily, each of the N*N cows (2 <= N <= 99; N odd) has her beauty rating (1 <= $R_{ij}$ <= 1,000) inscribed on a tag in her ear, just like in this picture.
Cows aren't so good at math, so FJ lines them up into an N x N square. He asks them to find the median cow in each row (the median cow is the one whose beauty number is bigger than or equal to half the cows in her group and also smaller than or equal to half the cows in her group -- the middle number of the group). From those N medians, FJ then finds the median of those numbers and brings that cow to the convention.
Given a set of N x N cows, find the beauty index of the most perfect (average) cow.

#include<bits/stdc++.h> #define MAX_INT ((unsigned)(-1)>>1) #define MIN_INT (~MAX_INT) #define pi 3.1415926535898 using namespace std; int n; int a[105][105]; int b[105]; int main(void) { cin>>n; for(int i=0;i<n;i++){ for(int j=0;j<n;j++){ cin>>a[i][j]; } sort(a[i],a[i]+n); b[i]=a[i][n/2]; } sort(b,b+n); cout<<b[n/2]; return 0; }

#include<bits/stdc++.h> using namespace std; int a[2001]; int n,ans[2001]; int main() { cin>>n; for(int i=1;i<=n;i++) { for(int j=1;j<=n;j++) { cin>>a[j]; } sort(a+1,a+n+1); ans[i]=a[(n/2)+1]; } sort(ans+1,ans+n+1); cout<<ans[(n/2)+1]; }

详情