USACO · 1251

COW College

This C++ solution uses binary search for USACO 1251 COW College. Read the reasoning, inspect the code, or try your own test case below.

1251Sorting & searchingBinary searchC++31 lines
Solution063of 248
Open official problem ↗ Download C++ file ↓ Search the library → Open full Code Lab ↗ Report an issue ↗

Approach

Binary search

COW College asks for maximum tuition revenue and the smallest tuition attaining it; the code sorts offers and checks each candidate.

Sorting & searching

Problem and code

Useful links.

Written by benbenyaojifen. Try the problem first, then compare your approach with the code.

Open official problem ↗View exact source file ↗
Implementation

cow_college.cpp

C++

    #include <bits/stdc++.h>
     
    using namespace std;
     
    #define int long long
     
    signed main(){
        ios::sync_with_stdio(0);
        cin.tie(0);
        int n;
        cin >> n;
        vector<int> cost;
        for(int i = 0; i < n; i++){
            int x;
            cin >> x;
            cost.push_back(x);
        }
        sort(cost.begin(), cost.end());
        int ans = -1;
        int best = 0;
        for(int c : cost){
            int cur = n - (lower_bound(cost.begin(), cost.end(), c) - cost.begin());
            cur *= c;
            if(cur > best){
                best = cur;
                ans = c;
            }
        }
        cout << best << " " << ans << '\n';
        return 0;
    }
        

Did this explanation save you time? I'm a Grade 11 student building this free library to make difficult algorithms easier to understand.

Buy me a coffee ↗Keep studying →

Test this problem

Run your code here.

Paste your code, run a test case, compare the output, or trace selected values.

Full trace, comparison & stress testing ↗
StatusReady
Output
No run yet.
Diagnostics
No diagnostics yet.

Each run is isolated and has strict limits. Passing one test does not guarantee the judge will accept the solution.