cf 1186d.md

cf 1186D Vus the Cossack and Numbers

#include<bits/stdc++.h>
using namespace std;
int main(){
    int n;
    cin >> n;
    long long sum=0;
    vector<double> q;
    for (int i=0;i<n;++i) {
        double t;
        cin >> t;
        sum+=floor(t);
        q.push_back(t);
    }
    for (int i=0;i<q.size();++i){
        auto t=floor(q[i]);
        if (sum<0 && t!=q[i]){
            cout << (int)t+1<<endl;
            ++sum;
        }else{
            cout << (int)t<<endl;
        }
    }
    return 0;
}