Submission #824374

#TimeUsernameProblemLanguageResultExecution timeMemory
824374petezaLet's Win the Election (JOI22_ho_t3)C++14
5 / 100
2548 ms212 KiB
#include <bits/stdc++.h> using namespace std; bool vis[505]; int n, k; int as, bs; vector<pair<int, int>> a, b; int todo=0,ptr=0; long double ans = 1e18, csum = 0; int main() { cin >> n >> k; for(int i=0;i<n;i++) { cin >> as >> bs; a.emplace_back(as, i); b.emplace_back(bs==-1 ? INT_MAX :bs, i); } sort(a.begin(), a.end()); sort(b.begin(), b.end()); for(int selb=0;selb<=b.size();selb++) { vector<bool> vis(n, 0); todo = k; csum = 0; ptr = 0; bool broke = 0; for(int i=0;i<selb;i++) { if(b[i].first == INT_MAX) broke = 1; vis[b[i].second] = 1; csum += 1.00*b[i].first/(i+1); todo--; } if(broke) break; while(todo > 0){ if(vis[a[ptr].second]) continue; csum += 1.00*a[ptr].first/(selb+1); todo--; ptr++; } ans = min(ans, csum); } cout << ans; }

Compilation message (stderr)

Main.cpp: In function 'int main()':
Main.cpp:20:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   20 |     for(int selb=0;selb<=b.size();selb++) {
      |                    ~~~~^~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...