Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
codeforces - 545D
//g++ 5.4.0 #include <iostream> #include <vector> #include <algorithm> using ulong = unsigned long int; using namespace std; struct cf545d { int time; int actualTime; }; int main() { int n, not_disappointed = 0; ulong s = 0; cin >> n; vector<ulong> v(n); //vector<ulong> sums(n, 0); for (int i = 0; i < n; i++) { cin >> v[i]; } sort(v.begin(), v.end()); //sums[0] = v[0]; /* for (int i = 0; i < n; i++) { for (int j = 0; j < i; j++) { sums[i] += v[j]; } cout << v[i] << "\t" << sums[i] << endl; } */ int index = 0; while (v[index] >= s) { s += v[index]; index++; } s = 0; for (int i = index; i < n; i++) { for (int j = i; j < n; j++) { if (v[j] > s) { swap(v[i], v[j]); //not_disappointed++; j = n; } } s += v[i]; //index++; } //cout << "******" << endl; for (int i = 1; i < n; i++) { //cout << v[i - 1] << endl; if (v[i - 1] <= v[i]) { not_disappointed++; } else { break; } } //cout << "******" << endl; //cout << s << endl; cout << not_disappointed << endl; return 0; }
run
|
edit
|
history
|
help
0
maximum_frequent_sum
vector destruction - gcc
is_sorted_30-Seconds-of-C++
AWE
Ultimate gauss
StrStrPbrk
Such case
Complete Over-Use of Functor Templates (Academic Experiment)
Boggle Game
Matrix