oj.uz

Submission #534212

# Submission time Handle Problem Language Result Execution time Memory
534212 2022-03-08T02:17:53 Z LittleOrange Let's Win the Election (JOI22_ho_t3) C++17
0 / 100
 21 ms 324 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
bool cmp(pair<double,double> a,pair<double,double> b){
    return a.second==b.second?a.first<b.first:(b.second<0&&a.second>=0||a.second>=0&&a.second<b.second);
}
int main(){
    ios::sync_with_stdio(0);cin.tie(0);
    int n,k;
    cin >> n >> k;
    vector<pair<double,double> > dat(n);
    int l = n;
    for (int i = 0;i<n;i++){
        cin >> dat[i].first >> dat[i].second;
        if (dat[i].second<0) l--;
    }
    double ans = 1000000;
    for (int i = 0;i<min(k,l);i++){
        double t = 0;
        sort(dat.begin(),dat.end(),cmp);
        for (int j = 0;j<i;j++){
            t += dat[j].second/(j+1);
        }
        sort(dat.begin()+i,dat.end());
        for (int j = i;j<k;j++){
            t += dat[j].first/(i+1);
        }
        ans = min(ans,t);
    }
    cout << fixed << setprecision(15) << ans << "\n";
}

Compilation message

Main.cpp: In function 'bool cmp(std::pair<double, double>, std::pair<double, double>)':
Main.cpp:5:58: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
    5 |     return a.second==b.second?a.first<b.first:(b.second<0&&a.second>=0||a.second>=0&&a.second<b.second);
      |                                                ~~~~~~~~~~^~~~~~~~~~~~~

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Incorrect 0 ms 204 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Incorrect 0 ms 204 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Incorrect 0 ms 204 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #6
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 21 ms 324 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -