1132B - Discounts - CodeForces Solution

greedy sortings *900

Please click on ads to support us..

Python Code: 

bars = int(input())
costs = [int(x) for x in input().split()]
coup = int(input())
c_amt = [int(x) for x in input().split()]
costs.sort()
total = sum(costs)
for i in c_amt:
    print(total - costs[i * -1])

C++ Code: 

#include<bits/stdc++.h>
using namespace std;

int main(){
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);

  int nq;
  cin>>nq;
  int arrq[nq];
  long long sumq = 0;
  for(int i = 0; i < nq; i++){
    cin>>arrq[i];
    sumq += arrq[i];
  }

  sort(arrq, arrq+nq, greater<int>());

  int mq;
  cin>>mq;
  int qq;
  for(int i = 0; i < mq; i++)
{
    cin>>qq;
    cout<<(sumq - arrq[qq - 1])<<'\n';
  }

}


Comments

Submit
0 Comments
More Questions

1626A - Equidistant Letters
977D - Divide by three multiply by two
1654B - Prefix Removals
1654A - Maximum Cake Tastiness
1649A - Game
139A - Petr and Book
1612A - Distance
520A - Pangram
124A - The number of positions
1041A - Heist
901A - Hashing Trees
1283A - Minutes Before the New Year
1654D - Potion Brewing Class
1107B - Digital root
25A - IQ test
785A - Anton and Polyhedrons
1542B - Plus and Multiply
306A - Candies
1651C - Fault-tolerant Network
870A - Search for Pretty Integers
1174A - Ehab Fails to Be Thanos
1169A - Circle Metro
780C - Andryusha and Colored Balloons
1153A - Serval and Bus
1487C - Minimum Ties
1136A - Nastya Is Reading a Book
1353B - Two Arrays And Swaps
1490E - Accidental Victory
1335A - Candies and Two Sisters
96B - Lucky Numbers (easy)