UVA 10954 - Add All
Problem PDF
Solution:
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#define ll long long
#define sc scanf
#define pf printf
#define Pi 2*acos(0.0)
using namespace std;
int main ()
{
int n,a;
while (sc("%d",&n))
{
if(n==0)
break;
priority_queuepq;
int sum=0,i,c=0;
for (i=0;i
https://github.com/Shipu/OnlineJudgeProblemSolutionWithCPlusPlus/tree/master/uva/10954/10954.cpp