Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
410
#include <iostream> #include <vector> #include <algorithm> #include <utility> using namespace std; int main() { int C, S; int entradas, indice, indice2=0; vector<int> datos; int j, suma, cm; double AVG, imbalance, imbalanceT; pair<int,int> pareja; while(cin >> C) { cout << "Set #" << indice2 << "\n"; imbalanceT = 0; suma = 0; datos.clear(); indice = 0; cin >> S; while(S--) { cin >> entradas; datos.push_back(entradas); suma += entradas; } AVG = (double)suma/C; //cout << "AVG: " << AVG << "\n"; if(datos.size()%2==1) datos.push_back(0); sort (datos.begin(), datos.end()); j = datos.size()-1; for(int i = 0; i < datos.size()/2; i++) { cout << " " << indice << ": "; cm = datos[i] + datos[j]; imbalance = cm - AVG; if(imbalance < 0) imbalance *= -1; imbalanceT += imbalance; if (datos[i]==0) cout << datos[j] << "\n"; else cout << datos[i] << " " << datos[j] << "\n"; j--; C--; indice++; } while(C--) { cout << " " << indice << ": \n"; indice++; } printf("IMBALANCE = %.5lf\n\n", imbalanceT); indice2++; } }
run
|
edit
|
history
|
help
0
Square of maximum
scope new delete
BadCastAllExcept
Defining Class Members
bmp_lb
12535
Beadandó
OperatorOverload2
Virtuals
Six Trigonometric Functions