Cod sursa(job #974070)
| Utilizator | Data | 16 iulie 2013 13:43:37 | |
|---|---|---|---|
| Problema | Lowest Common Ancestor | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
#define ull unsigned long long
ifstream fin("lumanari.in");
ofstream fout("lumanari.out");
const int N = 200005;
ull n, nrz, a[N], s[N];
int main()
{
fin>>n;
for(int i=1; i<=n; i++)
fin>>a[i];
sort(a+1,a+n+1);
s[1] = a[1];
for(int i=2; i<=n; i++)
s[i] = (ull)(s[i-1] + a[i]);
ull zp = 0, c = 1;
for(int i=1; i<=n; i++)
if(zp + c <= s[i])
zp += (ull)c, c++, nrz++;
fout<<nrz;
return 0;
}
